Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A 10/7 + " Approximation for Minimizing the Number of ADMs in SONET Rings
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Approximating the traffic grooming problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Better bounds for minimizing SONET ADMs
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Lightpath arrangement in survivable rings to minimize the switching cost
IEEE Journal on Selected Areas in Communications
Minimizing electronic line terminals for automatic ring protection in general WDM optical networks
IEEE Journal on Selected Areas in Communications
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
IEEE Journal on Selected Areas in Communications - Part Supplement
Approximating the traffic grooming problem in tree and star networks
Journal of Parallel and Distributed Computing
Approximating the traffic grooming problem
Journal of Discrete Algorithms
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Hardness and approximation of traffic grooming
Theoretical Computer Science
Hi-index | 0.00 |
A central problem in optical networks is to assign wavelengths to a given set of lightpaths, so that at most g of them that share a physical link get the same wavelength (g is the grooming factor). The switching cost for each wavelength is the number of distinct endpoints of lightpaths of that wavelength, and the goal is to minimize the total switching cost. We prove NP-completeness results for the problem of minimizing the switching costs in path networks. First we prove that the problem is NP-complete in the strong sense, when all demands are either 0 or 1, the routing is single-hop, and the number of wavelengths is unbounded. Next we prove that the problem is NP-complete for any fixed g ≥ 2, and when the number of wavelengths is bounded. These results improve upon existing results regarding the complexity of the traffic grooming problem for ring and path networks.