Survivable routing and regenerator placement in optical networks

Abstract

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.

An Overview of Algorithms for Network Survivability

“…We have considered how to verify that a network has certain connectivity properties, how to augment an existing network to reach a given connectivity, and, lastly, how to find alternative paths in case network failures occur. Our focus has been on algorithms for general networks, although much work has also been done for specific networks, such as optical networks, where additional constraints like wavelength continuity and signal impairments induce an increased complexity, for example, see our work [149][150][151].…”

Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators

“…As a final remark, the RWA problem has also been addressed with other objectives, as the minimization of the blocking probability for the dynamic scenarios where lightpath requests arrive one by one, at random (de Sousa et al 2015;Manousakis et al 2010;Beshir et al 2012). …”

Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort

“…In this work, we consider a regenerator placement problem, as tackled in , in particular the single request survivable routing and regenerator placement (SRSRRP) problem. The resolution of this problem aims at finding ℛ st , which is the minimum number of intermediate nodes where regenerators will be necessary for a demand ( s , t ).…”

“…For the sake of generality, we assume that the two paths of the pair can share regenerators on nodes which are common to both the AP and the BP, which is designated in as a dedicated‐shared variant of the SRSRRP problem. We assume that the BP may be used only in the event of failure of the AP.…”

“…The general term transponder may refer to any transponder, regardless of where it is located. A problem for devising the appropriate number and location of regenerators is formulated based on an approach in . Once the length of the longest transparent segment is known in the paths of the path pair for each demand, the appropriate transponders may be selected.…”