On the complexity of the regenerator placement problem in optical networks

Authors:
Michele Flammini;Alberto Marchetti Spaccamela;Gianpiero Monaco;Luca Moscardelli;Shmuel Zaks
Affiliations:
University of L'Aquila, L'Aquila, Italy;University of Rome, Rome, Italy;University of L'Aquila, l'Aquila, Italy;University of Chieti-Pescara, Pescara, Italy;Technion, Haifa, Israel
Venue:
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Year:
2009

Citing 7
Cited 4

A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Improved methods for approximating node weighted Steiner trees and connected dominating sets

Information and Computation
Ring routing and wavelength translation

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Wavelength conversion in optical networks

Journal of Algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Energy-Efficient Wireless Network Design

Theory of Computing Systems

Brief announcement: on regenerator placement problems in optical networks

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
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 dimensioning of WDM optical networks with impairment-aware regeneration

IEEE/ACM Transactions on Networking (TON)
Online optimization of busy time on parallel machines

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Placement of regenerators in optical networks has attracted the attention of recent research works in optical networks. In this problem we are given a network, with an underlying topology of a graph G, and with a set of requests that correspond to paths in G. There is a need to put a regenerator every certain distance, because of a decrease in the power of the signal. In this work we investigate the problem of minimizing the number of locations to place the regenerators. We present analytical results regarding the complexity of this problem, in four cases, depending on whether or not there is a bound on the number of regenerators at each node, and depending on whether or not the routing is given or only the requests are given (and part of the solution is also to determine the actual routing). These results include polynomial time algorithms, NP-complete results, approximation algorithms, and inapproximability results.