Wavelength-Aware Translucent Network Design

Computer Communications, 2006

Although significant advances have been achieved towards the deployment of all-optical networks, optical-electrical-optical (OEO) regeneration is still required due to the lack of proper all-optical processing and all-optical buffering. In order to have a practical, reliable, and cost effective optical transport network, the combination of both all-optical and OEO technologies is necessary. The ''islands of transparency'' network architecture has been proposed as a solution. This paper presents a two-layer hierarchical wavelength routing (THWR) protocol for the island of transparency optical network. The proposed THWR is a link state protocol that uses a two-layer hierarchy that partitions the network into routing areas, each of which represents an island of transparency. The proposed THWR implements a dynamic wavelength routing capability to balance the network load and avoid the congested area automatically. The complexity analysis and the simulation results of THWR are shown in the paper. The results show THWR is an effective protocol that meets the requirements for optical networks.

Although all-optical transport may be the ideal, some OEO conversions will likely be necessary to control signal impairments. The placement of OEO conversions in optical networks affects critical design targets such as degree of transparency, cost, and robustness vis-à-vis demand forecast uncertainties. We explore two different impairment-aware OEO placement paradigms, Focused Design and Uniform Design, that may address these targets

2010

Ever-increasing bandwidth demands and higher flexibility are the main challenges for the next generation optical core networks. A new trend in order to address these challenges is to consider the impairments of the lightpaths during the design of optical networks. In our work, we focus on translucent optical networks, where some lightpaths are routed transparently, whereas others go through a number of regenerators. We present a cost analysis of design strategies, which are based either on an exact Quality of Transmission (QoT) validation or on a relaxed one and attempt to reduce the amount of regenerators used. In the exact design strategy, regenerators are required if the QoT of a candidate lightpath is below a predefined threshold, assuming empty network conditions. In the relaxed strategy, this predefined threshold is lower, while it is assumed that the network is fully loaded. We evaluate techno-economically the suggested design solutions and also show that adding more flexibility to the optical nodes has a large impact to the total infrastructure cost.

Bell Labs Technical Journal, 2006

Optical technology promises to revolutionize data networking by providing enormous bandwidth for data transport at minimal cost. A key to cost reduction is to increase transparency, that is, to keep a data stream encoded as an optical signal for as long as possible. Wavelength switching increases transparency by allowing different data streams, each encoded in a different wavelength of light, to be independently routed through an optical network. We discuss Bell Labs-developed software tools that help design wavelength-switched optical networks. The software tools simultaneously minimize the cost of the designed network, reduce the time and cost to perform the design, and ensure compliance with engineering constraints. The tools span three levels of abstraction, from routing and reconfigurable add/drop multiplexer (ROADM) choice, to span engineering, to power dynamics simulation. Each level represents a different tradeoff between design scope and level of detail. For each class of tool, we briefly describe design philosophy, algorithms, performance, and resulting value for Lucent's customers. © 2006 Lucent Technologies Inc.

Photonic Network Communications, 2020

Translucent optical networks use sparsely located regenerator nodes to increase the optical reach, otherwise limited by the physical layer impairments. Routing in translucent networks often causes the lightpath to traverse a fiber more than once, requiring the use of multiple wavelengths on a fiber for the same lightpath. Most of the routing and wavelength assignment (RWA) algorithms for static demand in translucent networks (termed static RWA) require loop-free routes for shortest path routing and also are agnostic to traffic load. In this paper, we address the problem of static RWA in translucent networks without using physical layer information and show how to route lightpaths on paths with a loop (i.e., not a simple path). We propose integer linear programming formulation to get the exact solutions to the static RWA problem. This work is the first one to optimally solve the static RWA problem for non-simple paths, providing the lower bound on the number of wavelengths and regeneration needed for static lightpath establishment when regeneration facilities are limited. We propose a heuristic algorithm based on the concept of Wardrop equilibrium, to adaptively equalize the mean delay along all the lightpath routes from source to destination. The proposed heuristic can not only accommodate the correlation between feasible lightpath routes but also account for the fact that alternate routes correspond to different levels of choice randomness. Wavelength assignment is done using graph coloring with branch-and-price method. Numerical results demonstrate that the proposed heuristic reduces the number of regenerators and wavelengths required to satisfy a given demand.

Journal of Lightwave Technology, 2000

Physical impairments in optical fiber transmission necessitate the use of regeneration at certain intermediate nodes, at least for certain lengthy lightpaths. We design and implement impairment-aware algorithms for routing and wavelength assignment (IA-RWA) in translucent optical networks. We focus on the offline version of the problem, where we are given a network topology, the number of available wavelengths and a traffic matrix. The proposed algorithm selects the 3R regeneration sites and the number of regenerators that need to be deployed on these sites, solving the regenerator placement problem for the given set of requested connections. The problem can be also posed in a slightly different setting, where a (sparse) placement of regenerators in the network is given as input and the algorithm selects which of the available regenerators to use, solving the regenerator assignment problem. We formulate the problem of regenerator placement and regenerator assignment, as a virtual topology design problem, and address it using various algorithms, ranging from a series of integer linear programming (ILP) formulations to simple greedy heuristic algorithms. Once the sequence of regenerators to be used by the non-transparent connections has been determined, we transform the initial traffic matrix by replacing non-transparent connections with a sequence of transparent connections that terminate and begin at the specified 3R intermediate nodes. Using the transformed matrix we then apply an IA-RWA algorithm designed for transparent (as opposed to translucent) networks to route the traffic. Blocked connections are re-routed using any remaining regenerator(s) in the last phase of the algorithm.

IEEE/ACM Transactions on Networking, 2010

The user has requested enhancement of the downloaded file. All in-text references underlined in blue are added to the original document and are linked to publications on ResearchGate, letting you access and read them immediately.

Photonic Network Communications, 2011

Translucent WDM network design has been widely investigated during the last 10 years. Translucent networks stand halfway between opaque and transparent networks improving the signal budget while reducing the network cost. On one hand, opaque networks provide satisfying quality from source to destination by the use of electrical 3R regeneration (Re-amplifying, Reshaping , and Re-timing) at each network node. In addition to their high cost inherent to numerous 3R regenerations, opaque networks are also constrained by the bit-rate dependence of electrical components. Transparent networks, on the other hand, do not include any electrical regeneration; therefore, the signal quality is degraded due to the accumulation of linear and non-linear effects along the signal's route. Translucent networks include electrical regeneration at some network nodes. Among the different possible strategies for translucent network design, sparse regeneration inserts regenerators whenever needed to help establish connection requests. In this context, the objective of translucent network design is to judiciously choose the regeneration sites in order to guarantee a certain quality of transmission while minimizing the network cost. In this paper, we propose to solve the translucent network design problem by introducing a heuristic for routing, wavelength assignment, and regenerator placement. This heuristic, called COR2P (Cross-Optimization for RWA and Regenerator Placement) aims not only to minimize the number of required regenerators, but also to minimize the

Journal of Lightwave …, 2009

Physical impairments in optical fiber transmission necessitate the use of regeneration at certain intermediate nodes, at least for certain lengthy lightpaths. We design and implement impairment-aware algorithms for routing and wavelength assignment (IA-RWA) in translucent optical networks. We focus on the offline version of the problem, where we are given a network topology, the number of available wavelengths and a traffic matrix. The proposed algorithm selects the 3R regeneration sites and the number of regenerators that need to be deployed on these sites, solving the regenerator placement problem for the given set of requested connections. The problem can be also posed in a slightly different setting, where a (sparse) placement of regenerators in the network is given as input and the algorithm selects which of the available regenerators to use, solving the regenerator assignment problem. We formulate the problem of regenerator placement and regenerator assignment, as a virtual topology design problem, and address it using various algorithms, ranging from a series of integer linear programming (ILP) formulations to simple greedy heuristic algorithms. Once the sequence of regenerators to be used by the non-transparent connections has been determined, we transform the initial traffic matrix by replacing non-transparent connections with a sequence of transparent connections that terminate and begin at the specified 3R intermediate nodes. Using the transformed matrix we then apply an IA-RWA algorithm designed for transparent (as opposed to translucent) networks to route the traffic. Blocked connections are re-routed using any remaining regenerator(s) in the last phase of the algorithm.

The recent availability of new optical network elements makes possible to introduce new architectures and new functionality into the optical transport networks. Optical cross-connects and ultra long haul transmission equipment have emerged and opened a new opportunity to handle fully transparent connections and extend optically transparent domains. A translucent network is basically a network in which the network functions (transmission, routing, supervision, performance assessment, and survivability) are mainly performed in the optical domain. However, the use of opto-electronic components (e.g. components providing functions like wavelength conversion and 3R regeneration) to improve the performance of the translucent networks is not precluded. The current paper briefly introduces EURESCOM P1202 Project "Routing in Translucent Networks", and presents some illustrative results on the resource utilization aspects of transparency in optical networks.