Optimizing regenerator cost in traffic grooming

Authors:
Michele Flammini;Gianpiero Monaco;Luca Moscardelli;Mordechai Shalom;Shmuel Zaks
Affiliations:
Department of Computer Science, University of LAquila Via Vetoio, Loc. Coppito, 67100 LAquila, Italy;Department of Computer Science, University of LAquila Via Vetoio, Loc. Coppito, 67100 LAquila, Italy;Department of Science, University of Chieti-Pescara, Viale Pindaro 42, 65127 Pescara, Italy;TelHai Academic College, Upper Galilee, 12210, Israel;Department of Computer Science, Technion, Haifa, Israel
Venue:
Theoretical Computer Science
Year:
2011

Citing 9
Cited 0

Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture

SIAM Journal on Computing
Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs

Theoretical Computer Science
Wavelength assignment and generalized interval graph coloring

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs

Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
The regenerator location problem

Networks - Network Optimization (INOC 2007)
Minimizing total busy time in parallel scheduling with application to optical networks

Theoretical Computer Science
Placing regenerators in optical networks to satisfy multiple sets of requests

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On the complexity of the regenerator placement problem in optical networks

IEEE/ACM Transactions on Networking (TON)
Minimizing electronic line terminals for automatic ring protection in general WDM optical networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	5.23

Visualization

Abstract

In optical networks, regenerators have to be placed on lightpaths every d consecutive nodes in order to regenerate the signal. In addition, grooming enables the use of the same regenerator by several lightpaths. Up to g (the grooming factor) lightpaths can use the same regenerator. In this work we consider the problem of minimizing the number of regenerators used in traffic grooming in optical networks. Starting from the 4-approximation algorithm of Flammini et al. (2010) [10] for d=1 and a path topology, we provide an approximation algorithm with the same approximation ratio for d=1and the ring and tree topologies. We present also a technique based on matching that leads to the same approximation ratio in tree topology and can be used to obtain approximation algorithms in other topologies. We provide an approximation algorithm for general topology that uses this technique. Finally, all the results are extended to the case of general d.