A 10/7 + " Approximation for Minimizing the Number of ADMs in SONET Rings
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
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
A 10/7 + ε approximation for minimizing the number of ADMs in SONET rings
IEEE/ACM Transactions on Networking (TON)
Approximating the traffic grooming problem in tree and star networks
Journal of Parallel and Distributed Computing
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
Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
Graph-Theoretic Concepts in Computer Science
On the complexity of the traffic grooming problem in optical networks
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Hardness and approximation of traffic grooming
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Minimizing total busy time in parallel scheduling with application to optical networks
Theoretical Computer Science
Approximating the traffic grooming problem in tree and star networks
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Hi-index | 0.00 |
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, this can be viewed as assigning colors to the lightpaths so that at most g of them (g being the grooming factor) can share one edge. The cost of a coloring is the number of optical switches (ADMs); each lightpath uses two ADM's, one at each endpoint, and in case g lightpaths of the same wavelength enter through the same edge to one node, they can all use the same ADM (thus saving g – 1 ADMs). The goal is to minimize the total number of ADMs. This problem was shown to be NP-complete for g = 1 and for a general g. Exact solutions are known for some specific cases, and approximation algorithms for certain topologies exist for g = 1. We present an approximation algorithm for this problem. For every value of g the running time of the algorithm is polynomial in the input size, and its approximation ratio for a wide variety of network topologies – including the ring topology – is shown to be 2 ln g + o(ln g). This is the first approximation algorithm for the grooming problem with a general grooming factor g.