2004 | OriginalPaper | Chapter
Traffic Grooming in a Passive Star WDM Network
Authors : Eric Angel, Evripidis Bampis, Fanny Pascual
Published in: Structural Information and Communication Complexity
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We consider the traffic grooming problem in passive WDM star networks. Traffic grooming is concerned with the development of techniques for combining low speed traffic components onto high speed channels in order to minimize network cost. We first prove that the traffic grooming problem in star networks is NP-hard for a more restricted case than the one considered in [2]. Then, we propose a polynomial time algorithm for the special case where there are two wavelengths per fiber using matching techniques. Furthermore, we propose two reductions of our problem to two combinatorial optimization problems, the constrained multiset multicover problem [3], and the demand matching problem [4] allowing us to obtain a polynomial time H2C (resp. $2+\frac{4}{5}$) approximation algorithm for the minimization (resp. maximization) version of the problem, where C is the capacity of each wavelength.