Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
Theoretical Computer Science
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
Grooming of arbitrary traffic in SONET/WDM BLSRs
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
SONET ADMs minimization with divisible paths
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
| Hi-index | 5.23 |
We consider a problem which arises in optical routing. WDM/SONET rings are a network architecture used by telecommunications carriers for traffic streams. The dominant cost factor in such networks is the total number of add-drop multiplexers (ADMs) used. A list of traffic streams to be routed between pairs of nodes is given. In this paper we consider the problem where we need to assign a route and a wavelength to each traffic stream, minimizing the total number of used SONET ADMs. This is called the chord version of the SONET ADMs minimization problem, to denote the fact that the routing is not given a priori. The best previously known approximation algorithms for this problem have the performance guarantee of 3/2. We present an improved algorithm with performance guarantee of exactly 10/7 ≈ 1.42857. Moreover, we study some natural heuristics for this problem, and give tight analysis of their approximation ratios.