Paper Info
Title
Traffic Grooming in a Passive Star WDM Network
Abstract
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 H-2C (resp. 2 + 4/5) approximation algorithm for the minimization (resp. maximization) version of the problem, where C is the capacity of each wavelength.
Year
DOI
Venue
2004
10.1007/978-3-540-27796-5_1
LECTURE NOTES IN COMPUTER SCIENCE
Keywords
Field
DocType
star,traffic grooming,WDM network,approximation,algorithm
Approximation algorithm,Star network,Multiset,Computer science,Algorithm,Combinatorial optimization,Communication complexity,Time complexity,Traffic grooming,Constrained optimization
Conference
Volume
ISSN
Citations 
3104
0302-9743
2
PageRank 
References 
Authors
0.40
4
3
Name
Order
Citations
PageRank
Eric Angel111614.54
Evripidis Bampis257155.19
Fanny Pascual39714.48