Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests

Mertzios, George B.; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel

doi:10.1109/tnet.2012.2186462

Cited by 16 publications

(11 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In practice, the 3R signal regeneration process is used to re-amplify, reshape and re-time the signal for wide-area backbone networks. Such regenerators are rather expensive equipment (e.g., $160K, see Mertzios, Sau, Shalom, & Zaks (2012) ), and much research has been conducted, concerning minimizing their usage while satisfying all or most of the communication requirements posed by the clients. The cost of regenerators in a network is measured in two main ways: (1) the number of regenerators placed in the network, and (2) the number of locations in which regenerators are placed ( Hartstein, Shalom, & Zaks, 2013 ).…”

Section: Introductionmentioning

confidence: 99%

Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms

Aneja

2017

European Journal of Operational Research

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms

Aneja

2017

European Journal of Operational Research

View full text Add to dashboard Cite

“…Kuipers et al [11] and Mertzios et al [12] consider selective regenerator placement in a given optical network, while Katrinis and Tzanakaki [10] combine regenerator placement with network design, where only the node locations are predetermined. Beshir et al [3] minimize the amount of transceivers for survivable impairment-aware traffic grooming in WDM rings.…”

Section: B Related Workmentioning

confidence: 99%

“…The above results can be strengthened in the case where all links have equal cost. Several papers (e.g., [12], [6]) take hopcount as the impairment metric and argue that a limit on the maximum hopcount between regenerators provides a valid placement strategy in practice. In such a case, each link has a cost of 1, corresponding to one hop.…”

Section: Dedicated Protectionmentioning

confidence: 99%

Survivable routing and regenerator placement in optical networks

Beshir

Kuipers

Orda

et al. 2012

2012 IV International Congress on Ultra Modern Telecommunications and Control Systems

View full text Add to dashboard Cite

Abstract-The large capacity of WDM optical networks facilitates the transportation of impressive volumes of traffic, which make survivability schemes that can reroute traffic upon a failure in the network highly important. Besides survivability, the signal quality in optical networks, which degrades along its path due to physical impairments, needs consideration. In this paper, we consider the design problem of where to place regenerators in the network such that both the primary and backup lightpaths for a (predicted) traffic matrix obey the impairment constraints. We study the survivable routing and regenerator placement problem under dedicated and shared protection schemes, analyze the complexity of both problem variants, and subsequently propose efficient algorithms to solve or approximate them.

show abstract

“…We first provide in Section 2 some standard preliminaries. Due to space limitations, almost all proofs are omitted in this extended abstract (except that of Proposition 1); they can be found in [16].…”

Section: Our Contributionmentioning

confidence: 99%

Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests

Mertzios

Shalom

et al. 2010

Automata, Languages and Programming

Self Cite

View full text Add to dashboard Cite

Abstract. The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, regenerators must be placed in such a way that in any lightpath there are no more than d hops without meeting a regenerator. While most of the research has focused on heuristics and simulations, the first theoretical study of the problem has been recently provided in [10], where the considered cost function is the number of locations in the network hosting regenerators. Nevertheless, in many situations a more accurate estimation of the real cost of the network is given by the total number of regenerators placed at the nodes, and this is the cost function we consider. Furthermore, in our model we assume that we are given a finite set of p possible traffic patterns (each given by a set of lightpaths), and our objective is to place the minimum number of regenerators at the nodes so that each of the traffic patterns is satisfied. While this problem can be easily solved when d = 1 or p = 1, we prove that for any fixed d, p ≥ 2 it does not admit a PTAS, even if G has maximum degree at most 3 and the lightpaths have length O(d). We complement this hardness result with a constant-factor approximation algorithm with ratio ln(d · p). We then study the case where G is a path, proving that the problem is NP-hard for any d, p ≥ 2, even if there are two edges of the path such that any lightpath uses at least one of them. Interestingly, we show that the problem is polynomial-time solvable in paths when all the lightpaths share the first edge of the path, as well as when the number of lightpaths sharing an edge is bounded. Finally, we generalize our model in two natural directions, which allows us to capture the model of [10] as a particular case, and we settle some questions that were left open in [10].

show abstract

Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests

Cited by 16 publications

References 27 publications

Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms

Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms

Survivable routing and regenerator placement in optical networks

Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests

Contact Info

Product

Resources

About