On the complexity of the regenerator placement problem in optical networks

Authors:
Michele Flammini;Alberto Marchetti-Spaccamela;Gianpiero Monaco;Luca Moscardelli;Shmuel Zaks
Affiliations:
Dipartimento di Informatica, Università di L'Aquila, L'Aquila, Italy;Dipartimento di Informatica e Sistemistica, Sapienza Università di Roma, Rome, Italy;CNRS, UNSA, INRIA, Sophia-Antipolis, France and Dipartimento di Informatica, Università, di L'Aquila, L'Aquila, Italy;Dipartimento di Scienze, Università di Chieti-Pescara, Pescara, Italy;Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2011

Citing 9
Cited 6

A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved methods for approximating node weighted Steiner trees and connected dominating sets

Information and Computation
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
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
The regenerator location problem

Networks - Network Optimization (INOC 2007)

Optimizing regenerator cost in traffic grooming

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Optimizing regenerator cost in traffic grooming

Theoretical Computer Science
Online regenerator placement

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
Novel strategies for sparse regenerator placement in translucent optical networks

Photonic Network Communications
Placing regenerators in optical networks to satisfy multiple sets of requests

IEEE/ACM Transactions on Networking (TON)

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 paper, 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-completeness results, approximation algorithms, and inapproximability results.