Traffic Grooming on the Path - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2007

Traffic Grooming on the Path

(1) , (2) , (1)
1
2

Abstract

In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we will say that the grooming factor is C. That means that on a given edge of the network we can groom (group) at most C requests on the same wavelength. With this constraint the objective can be either to minimize the number of wavelengths (related to the transmission cost) or minimize the number of Add Drop Multiplexers (shortly ADM) used in the network (related to the cost of the nodes). We consider here the case where the network is a path on N nodes, P_N. Thus the routing is unique. For a given grooming factor C minimizing the number of wavelengths is an easy problem, well known and related to the load problem. But minimizing the number of ADM's is NP-complete for a general set of requests and no results are known. Here we show how to model the problem as a graph partition problem and using tools of design theory we completely solve the case where C=2 and where we have a static uniform all-to-all traffic (one request for each pair of vertices).
Fichier principal
Vignette du fichier
BBC-to-tcsa.pdf (251.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00308716 , version 1 (31-07-2008)

Identifiers

Cite

Jean-Claude Bermond, Laurent Braud, David Coudert. Traffic Grooming on the Path. Theoretical Computer Science, 2007, Structural Information and Communication Complexity (SIROCCO 2005), 384 (2-3), pp.139-151. ⟨10.1016/j.tcs.2007.04.028⟩. ⟨inria-00308716⟩
111 View
355 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More