On minimizing the number of ADMs---Tight bounds for an algorithm without preprocessing
Journal of Parallel and Distributed Computing
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
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
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
Optimizing regenerator cost in traffic grooming
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
On minimizing the number of ADMs – tight bounds for an algorithm without preprocessing
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
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
On the complexity of the regenerator cost problem in general networks with traffic grooming
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Minimum cost dimensioning of ring optical networks
Optical Switching and Networking
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.07 |
Automatic ring protection provides simple and rapid fault protection and restoration in telecommunication networks. To implement the automatic ring protection in general wavelength-division multiplexing (WDM) optical networks, the lightpaths are partitioned into groups each of which can be carried in a simple cycle of the underlying network. As the electronic line terminals are the dominant cost factor in the deployment of WDM optical networks, we study how to generate these partitions with minimum electronic line terminals. This optimization problem is NP-hard. We develop two polynomial-time approximation algorithms, with performance guarantees between 1.5 and 1.6 and between 1.5 and 1.5 + ε, respectively. The second algorithm can be adapted, with the same performance guarantees, to the problem in which lightpaths are not prespecified and only the endpoints of each connection are given. Both algorithms can be easily adapted, with the same performance guarantees, to the problem in which only link protection is desired, and each group must be carried in a closed trail. The first algorithm matches and the second algorithm improves the approximation ratio obtained independently by Eilam et al. (see 14th Int. Symp. Distributed Computing, 2000)