A 10/7 + ε approximation for minimizing the number of ADMs in SONET rings

Authors:
Mordechai Shalom;Shmuel Zaks
Affiliations:
Faculty of Computer Science, Technion, Haifa, Israel;Faculty of Computer Science, Technion, Haifa, Israel
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2007

Citing 9
Cited 3

On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems

SIAM Journal on Discrete Mathematics
Ring routing and wavelength translation

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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
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
Traffic grooming on the path

SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Grooming of arbitrary traffic in SONET/WDM BLSRs

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

On Equilibria for ADM Minimization Games

SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Optimal on-line colorings for minimizing the number of ADMs in optical networks

Journal of Discrete Algorithms
Approximation algorithms for grooming in optical network design

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

SONET add/drop multiplexers (ADMs) are dominant cost factors in WDM SONET rings. Whereas most previous papers on the topic concentrated on the number of wavelengths assigned to a given set of lightpaths, more recent papers argue that the number of ADMs is a more realistic cost measure. Some of these works discuss various heuristic algorithms for this problem, and the best known result is a 3/2 approximation in Calinescu and Wan, 2002. Through the study of the relation between this problem and the problem of finding maximum disjoint rings in a given set of lightpaths we manage to shed more light onto this problem and to develop a 10/7 + ε approximation for it.