Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
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
Hardness and approximation of traffic grooming
Theoretical Computer Science
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
Optimizing regenerator cost in traffic grooming
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Approximation Algorithms
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
| Hi-index | 0.00 |
We consider the problem of minimizing the number of regenerators in optical networks with traffic grooming. In this problem we are given a network with an underlying topology of a graph G, a set of requests that correspond to paths in G and two positive integers g and d. There is a need to put a regenerator every d edges of every path, because of a degradation in the quality of the signal. Each regenerator can be shared by at most g paths, g being the grooming factor. On the one hand, we show that even in the case of d=1 the problem is APX−hard, i.e. a polynomial time approximation scheme for it does not exist (unless P=NP). On the other hand, we solve such a problem for general G and any d and g, by providing an O(logg)-approximation algorithm and thus extending previous results holding only for specific topologies and specific values of d or g.