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
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
On the complexity of the traffic grooming problem in optical networks
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
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
Multiwavelength lightwave networks for computer communication
IEEE Communications Magazine
Dense wavelength division multiplexing networks: principles and applications
IEEE Journal on Selected Areas in Communications
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
Review of Fundamentals of Optical Fiber Systems
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
Architectural considerations for photonic switching networks
IEEE Journal on Selected Areas in Communications
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
Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Traffic grooming in star networks via matching techniques
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
We consider the problem of grooming paths in all-optical networks with tree topology so as to minimize the switching cost, measured by the total number of used ADMs. We first present efficient approximation algorithms with approximation factor of 2ln(@d@?g)+o(ln(@d@?g)) for any fixed node degree bound @d and grooming factor g, and 2lng+o(lng) in unbounded degree directed trees, respectively. In the attempt to extend our results to general undirected trees, we completely characterize the complexity of the problem in star networks by providing polynomial time optimal algorithms for g@?2 and proving the intractability of the problem for any fixed g2. While for general topologies, the problem was known to be NP-hard g not constant, the complexity for fixed values of g was still an open question.