Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
SIAM Journal on Computing
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)
Survivable impairment-aware traffic grooming in WDM rings
Proceedings of the 23rd International Teletraffic Congress
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
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
| Hi-index | 0.00 |
In optical networks regenerators have to be placed on lightpaths in order to regenerate the signal. In addition, grooming enables the use of the same regenerator by several lightpaths. In this work we consider the problem of minimizing the number of regenerators used in traffic grooming in optical networks. We deal with the case in which a regenerator has to be placed at every internal node of each lightpath. Up to g (the grooming factor) lightpaths can use the same regenerator. Starting from the 4-approximation algorithm of [7] that solves this problem for a path topology, we provide an approximation algorithm with the same approximation ratio for 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.