Hardness and approximation of traffic grooming
Theoretical Computer Science
Hardness and approximation of traffic grooming
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Approximation algorithms for traffic grooming in WDM rings
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
On approximating the d-girth of a graph
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Survivable impairment-aware traffic grooming in WDM rings
Proceedings of the 23rd International Teletraffic Congress
Parameterized complexity of finding small degree-constrained subgraphs
Journal of Discrete Algorithms
Traffic grooming in star networks via matching techniques
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Minimum cost dimensioning of ring optical networks
Optical Switching and Networking
On approximating the d-girth of a graph
Discrete Applied Mathematics
Hi-index | 0.00 |
The problem of minimizing the number of bidirectional SONET rings required to support a given traffic demand has been studied by several researchers. Here we study the related ring-grooming problem of minimizing the number of add/drop locations instead of the number of rings; in a number of situations this is a better approximation to the true equipment cost. Our main result is a new lower bound for the case of uniform traffic. This allows us to prove that a certain simple algorithm for uniform traffic is, in fact, a constant-factor approximation algorithm, and it also demonstrates that known lower bounds for the general problem—in particular, the linear programming relaxation—are not within a constant factor of the optimum. We also show that our results for uniform traffic extend readily to the more practically important case of quasi-uniform traffic. Finally, we show that if the number of nodes on the ring is fixed, then ring grooming is solvable in polynomial time; however, whether ring grooming is fixed-parameter tractable is still an open question. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(3), 194–202 2004