Grooming of arbitrary traffic in SONET/WDM BLSRs
IEEE Journal on Selected Areas in Communications
A 10/7 + " Approximation for Minimizing the Number of ADMs in SONET Rings
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
The chord version for SONET ADMs minimization
Theoretical Computer Science
On minimizing the number of ADMs---Tight bounds for an algorithm without preprocessing
Journal of Parallel and Distributed Computing
Theoretical Computer Science
Selfishness, collusion and power of local search for the ADMs minimization problem
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Better bounds for minimizing SONET ADMs
Journal of Computer and System Sciences
On minimizing the number of ADMs in a general topology optical network
Discrete Applied Mathematics
Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Hardness and approximation of traffic grooming
Theoretical Computer Science
Optimal on-line colorings for minimizing the number of ADMs in optical networks
Journal of Discrete Algorithms
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
Selfishness, collusion and power of local search for the ADMs minimization problem
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
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
SONET ADMs minimization with divisible paths
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Approximating the traffic grooming problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On minimizing the number of ADMs in a general topology optical network
DISC'06 Proceedings of the 20th international conference on Distributed Computing
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Minimizing the number of ADMs in SONET rings with maximum throughput
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Optimal on-line colorings for minimizing the number of ADMs in optical networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Hi-index | 0.01 |
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and wavelength assignment of the traffic streams. Following previous work, we consider the problem where the route of each traffic stream is given as input, and we need to assign wavelengths so as to minimize the total number of used SONET ADMs. This problem is known to be NP-hard, and the best known approximation algorithm for this problem has a performance guarantee of $\frac{3}{2}$. We improve this result, and present a $\frac{10}{7}$-approximation algorithm. We also study some of the previously proposed algorithms for this problem, and give either tight or tighter analysis of their approximation ratio.