Offline Impairment-Aware Routing and Wavelength Assignment Algorithms in Translucent WDM Optical Networks

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.      

Cost efficient traffic grooming and regenerator placement in impairment-aware optical WDM networks

In this paper, we address the problem of traffic grooming and regenerator placement in a WDM optical network in which lightpaths are hop-constrained by physical impairments. The efficient placement of regenerators and electronic grooming equipment at ROADM nodes for a given network topology is required such that all traffic demands can be supported with minimum cost. We present a detailed ROADM node architecture together with an associated cost model. We model the problem by Integer Linear Programming (ILPs) and propose an auxiliary-graph-based heuristic for jointly placing regenerators and electronic grooming equipment in the network. To evaluate the performance of the proposed heuristic, we also derive a lower bound on the network cost. The numerical results show that combining the grooming problem with the placement of regenerators reduces the network cost significantly compared to the cases in which traffic grooming and regenerator placement are handled separately. The performance of the proposed polynomial-time heuristic is very close to the lower bound and approaches the bound as the network load increases.     

Sparse Regeneration in Translucent Wavelength-Routed Optical Networks: Architecture,Network Design and Wavelength Routing

In this paper we study an alternate network architecture, called translucent network, to the fully transparent and fully opaque network architectures. In a translucent wavelength-routed optical network, a technique called sparse regeneration is used to overcome the severe lightpath blocking due to signal quality degradation and wavelength contention in a fully transparent network while using much less regenerators than in a fully opaque network. In this paper, we present a node model and a network model that perform sparse regeneration. We address the problem of translucent network design by proposing several regenerator placement algorithms based on different knowledge of future network traffic patterns. We also address the problem of wavelength routing under sparse regeneration by incorporating two regenerator allocation strategies with heuristic wavelength routing algorithms. We compare the performance of different regenerator placement algorithms and wavelength routing schemes through simulation experiments. The benefit of sparse regeneration is quantitatively measured under different network settings.This work was supported by NSF grants (ANI-0074121 and EPS-0091900).Portions of this work have appeared in the Proceedings of the OSA Optical Fiber Communications (OFC 1999) Conference [6] and the Proceedings of the IEEE Global Telecommunications (GLOBECOM 2001) Conference [12].     

Optimal regenerator assignment and resource allocation strategies for translucent optical networks

Physical layer impairments in wavelength-routed networks limit the maximum distance, a signal can travel in the optical domain, without significant distortion. Therefore, signal regeneration is required at some intermediate nodes for long-haul lightpaths. In translucent WDM networks, sparsely located regenerators at certain nodes can be used to offset the impact of physical layer impairments. The routing and wavelength assignment (RWA) techniques in such translucent networks need to take into consideration the availability of regenerators and the maximum optical reach of the transparent lightpaths (without any regeneration). Although there has been significant research interest in RWA algorithms for translucent networks, much of the research has focused on dynamic RWA techniques. Only a handful of recent papers have considered the static (offline) case, and they typically propose heuristic algorithms to solve this complex design problem for practical networks. In this paper, we propose a generalized integer linear program (ILP) based formulation for static regenerator assignment and RWA in translucent WDM optical networks, with sparse regenerator placement. To the best of our knowledge, such a formulation that optimally allocates resources for a set of lightpaths for translucent networks, given the physical network, the locations of the regenerators, and the maximum optical reach has not been considered before. The proposed formulation is important for two reasons. First, it can serve as a benchmark for evaluating different heuristic approaches that may be developedin the future. Second, we show that using a novel node representation technique, it is possible to drastically reduce the number of integer variables. This means that unlike existing ILP formulations, our approach can actually be used to generate optimal solutions for practical networks, with hundreds of lightpath demands.     

Hierarchical self-healing rings

Traffic restoration in case of a failure in a circuit-switched telecommunications network involves finding alternate paths for all working paths that are severed by the failure, and rerouting affected traffic on these alternate paths. A new hierarchical self-healing ring (HSHR) architecture for circuit-switched networks is proposed and the design of HSHR networks is considered. A general cost model incorporating both the installation cost and the material cost is used. It is shown that the enumeration method, which finds the optimum configuration of HSHR, can only be used for small networks due to the complexity. Heuristic algorithms to find near-optimum HSHR configurations are presented. The routing and dimensioning of HSHR are also considered. Dimensioning of an HSHR is transformed into dimensioning of single self-healing rings inside the HSHR. Numerical results show that the performance of the heuristic is satisfactory     

Translucent network design from a CapEx/OpEx perspective

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 reg regeneration (Re-amplifying, Re-shaping, 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 number of regeneration sites. In this perspective, we introduce an original cost function that contributes to the optimization of CapEx/OpEx expenditures in translucent network design. In fact, the CapEx-to-OpEx ratio strongly depends on the pricing and management strategy of the carrier. In this respect, COR2P is designed in a way that its parameters can be adjusted according to carriers’ strategies. In order to discuss its different features, we compare COR2P performance with two other algorithms proposed in the literature for translucent network design.     

On Achieveing Bandwidth-Aware LSP//spl lambda/SP Multiplexing/Separation in Multi-layer Networks

We present a new traffic engineering (TE) model which is based on QoS rerouting and uses hybrid resilience to improve the recovery performance of multi-layer networks where an MPLS network is layered above an MPlambdaS network. We formulate the rerouting of the LSPs/lambdaSPs as a multi-constrained problem and use its polynomial reduction to find a heuristic solution that can be implemented by standardized constraint-based routing algorithms. This heuristic solution uses a cost-based routing optimization to achieve different network configurations which multiplex/separate bandwidth-aware LSPs/lambdaSPs on the network links. We formulate the resilience upon failure as a multi-objective problem consisting of finding a resilience strategy that minimizes recovery operation time and maximizes the LSP/lambdaSP restorability. A solution to this problem is proposed where a hybrid resilience framework is used to achieve restoration in the MPLS layer to complement path switching in the MPlambdaS layer. We evaluate the performance of the TE model when rerouting the tunnels carrying the traffic offered to a 23- and 31-node networks. Simulation reveals that the hybrid resilience model performs better than classical recovery mechanisms. In terms of restorability, quality of rerouting paths and rerouting stability     

Performance and testbed study of topology reconfiguration in IP over optical networks

With the widespread deployment of Internet protocol/wavelength division multiplexing (IP/WDM) networks, it becomes necessary to develop traffic engineering (TE) solutions that can effectively exploit WDM reconfigurability. More importantly, experimental work on reconfiguring lightpath topology over testbed IP/WDM networks is needed urgently to push the technology forward to operational networks. This paper presents a performance and testbed study of topology reconfiguration for IP/WDM networks. IP/WDM TE can be fulfilled in two fashions, overlay vs. integrated, which drives the network control software, e.g., routing and signaling protocols, and selects the corresponding network architecture model, e.g., overlay or peer-to-peer. We present a traffic management framework for IP over reconfigurable WDM networks. Three "one-hop traffic maximization"-oriented heuristic algorithms for lightpath topology design are introduced. A reconfiguration migration algorithm to minimize network impact is presented. To verify the performance of the topology design algorithms, we have conducted extensive simulation study. The simulation results show that the topologies designed by the reconfiguration algorithms outperform the fixed topology with throughput gain as well as average hop-distance reduction. We describe the testbed network and software architecture developed in the Defense Advanced Research Projects Agency (DARPA) Next Generation Internet (NGI) SuperNet Network Control and Management project and report the TE experiments conducted over the testbed.     

Distributed Dijkstra sparse placement routing algorithm for translucent optical networks

In this paper we study translucent optical networks as an alternative to fully transparent and fully opaque optical networks. In the former networks, a technique called sparse placement is used to overcome the lightpath blocking caused by the signal quality degradation, using much less regenerators, which must strategically be placed, in contrast to a fully opaque network. In this paper we propose a sparse placement algorithm based on two requirements. The first one is signal regeneration necessary to re-amplify, reshape, and retime the optical signals after some predefined transparent distance in order to successfully receive the signals at the destination node. The other is load balance of the traffic in the network aimed at efficient usage of the network capacity resources. We apply a distributed Dijkstra routing algorithm which dynamically changes weights of links during the process of locating regeneration capable nodes. We compare the performance of the proposed algorithm with commonly used sparse placement algorithms through simulation experiments. The benefits are such that load balancing of the network traffic is fully utilized, and with technological development it will be sufficient to equip up to 30% of nodes in the network with electronic regenerations in order to have the same performance as in an opaque network.

Design of Translucent Optical Networks: Partitioning and Restoration

We discuss the problem of designing translucent optical networks composed of restorable, transparent subnetworks interconnected via transponders. We develop an integer linear programming (ILP) formulation for partitioning an optical network topology into subnetworks, where the subnetworks are determined subject to the constraints that each subnetwork satisfies size limitations, and it is two-connected. A greedy heuristic partitioning algorithm is proposed for planar network topologies. We use section restoration for translucent networks where failed connections are rerouted within the subnetwork which contains the failed link. The network design problem of determining working and restoration capacities with section restoration is formulated as an ILP problem. Numerical results show that fiber costs with section restoration are close to those with path restoration for mesh topologies used in this study. It is also shown that the number of transponders with the translucent network architecture is substantially reduced compared to opaque networks.     

Cross-layer routing in clustered optical networks

Physical layer impairment aware routing algorithms have been proposed for optical transparent networks in order to calculate the feasibility of dynamically establishing an optical path when no regeneration is used. The benefit of node clustering in optical networks, regarding routing with physical layer impairment awareness, is investigated under the CANON network architecture where regenerators are conveniently placed and routing is confined among a small subset of nodes. The CANON architecture exhibits enhanced blocking performance, high resource utilisation and adequate physical performance; hence, it can serve Quality of Service.     

Accounting for Shared Regenerators in GMPLS-Controlled Translucent Optical Networks

In translucent optical networks, the usage of sparse opto-electronic regenerators permits to overcome optical signal quality degradations. In dynamic translucent optical networks, where lightpaths are established upon request, regenerators can be effectively time shared. However, the current generalized multiprotocol label switching (GMPLS) protocol suite does not consider how to dynamically reserve and release shared regenerators and how to distribute regenerator availability information to network nodes. In this paper, four Translucent Lightpath Dynamic Provisioning (TLDP) schemes are proposed to establish lightpaths in dynamic distributed translucent optical networks. TLDP schemes differently combine the utilization of specific open shortest path first-traffic engineering (OSPF-TE) or resource reservation protocol-traffic engineering (RSVP-TE) extensions and shared regenerator availability information. Simulation results show that TLDP scheme based on OSPF-TE extensions obtains lower lightpath setup time, but higher control plane load than TLDP schemes based on RSVP-TE extensions. Moreover, schemes based on RSVP-TE extensions or on OSPF-TE extensions obtain the same lowest blocking probability.      

WDM抗毁网状网络中的业务量疏导算法

研究具有抗毁能力的WDM网状网中的业务量疏导设计问题，提出几种以网络吞吐量为优化目标的启发式算法，并通过计算机仿真分析，证实了基于最大化资源利用率的算法具有很好的性能。     

Dynamic routing in translucent WDM optical networks: the intradomain case

Translucent wavelength-division multiplexing optical networks use sparse placement of regenerators to overcome physical impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks at a much less cost. In previous studies, we addressed the placement of regenerators based on static schemes, allowing for only a limited number of regenerators at fixed locations. This paper furthers those studies by proposing a dynamic resource allocation and dynamic routing scheme to operate translucent networks. This scheme is realized through dynamically sharing regeneration resources, including transmitters, receivers, and electronic interfaces, between regeneration and access functions under a multidomain hierarchical translucent network model. An intradomain routing algorithm, which takes into consideration optical-layer constraints as well as dynamic allocation of regeneration resources, is developed to address the problem of translucent dynamic routing in a single routing domain. Network performance in terms of blocking probability, resource utilization, and running times under different resource allocation and routing schemes is measured through simulation experiments.     

On the effect of channel spacing,launch power,and regenerator placement on the design of mixed-line-rate optical networks

Due to the increasing heterogeneity and the growing volume of traffic, telecom backbone networks are going through significant innovations. Wavelength-division multiplexed (WDM) optical networks can now cost-effectively support the growing heterogeneity of traffic demands by having mixed line rates (MLR) over different wavelength channels.The coexistence of wavelength channels with different line rates, e.g., 10/40/100 Gbps, in the same fiber brings up various design issues: in this study, we focus on (1) choice of channel spacing; (2) choice of launch power; and (3) regenerator placement. Channel spacing affects the signal quality in terms of bit-error rate (BER), and hence affects the maximum reach of lightpaths, which is a function of line rates. Various approaches to set an opportunistic width of the channel spacing can be considered, viz., (i) uniform fixed channel spacing specified by the ITU-T grid (typically 50 GHz); (ii) different channel spacing for different line rates; or (iii) optimal value of channel spacing for all line rates that leads to minimum cost.The launch optical power of a signal is another important parameter that affects the network cost. Adjacent channels on different line rates, especially 10 Gbps and 100 Gbps, may exhibit serious degradation of signal quality and optical reach for both the channels due to cross-phase modulation (XPM) between them. Launch power plays a role in such a scenario as it governs the BER by affecting both the signal power and the noise power due to XPM. Moreover, intelligent choice of launch powers on different line rates can significantly reduce the number of regenerators required in the network. The tradeoff between placement of regenerators and choice of launch power is an important problem to address for MLR network design.In this work, we investigate the effects of channel spacing and launch optical power by evaluating the cost of a MLR network for different values of these parameters. We also study the interplay between regenerator placement and launch power. Our results show that (a) it is possible to identify optimal values of channel spacing for a minimum-cost MLR network design, and (b) controlling the power of 10 Gbps and 100 Gbps channels shows maximum sensitivity to the network cost.     

Novel strategies for sparse regenerator placement in translucent optical networks

In this paper, we propose two strategies for sparse regenerator placement (RP) in translucent optical networks, named most used regenerator placement (MU-RP), and most simultaneous used regenerator placement (MSU-RP). Our proposals are compared to well known RP algorithms presented in literature for two different network topologies for different network loads, distribution of load along the networks and number of translucent nodes. MSU-RP presented remarkable results and outperformed all previous approaches in all cases, while MSU-RP obtained a slightly superior or similar performance when compared to previous approaches presented in the literature.     

On the application of the blocking island paradigm in all-optical networks

We investigate the problem of routing and wavelength assignment as well as the problem of the placement of wavelength converters in all-optical networks. In particular, we present a general framework, based on the blocking island (BI) paradigm, to illustrate how it can be used to solve these problems in a unified way. We first give a brief introduction about the BI graph network model, and then use this model to derive simple and general algorithms that can be used in various applications in optical networks. We discuss the implementation issues of our algorithms and present simulation results to evaluate and compare our solutions with other heuristic algorithms under both static and dynamic traffic assumptions.     

A Traffic Engineering Approach for Placement and Selection of Network Services

Network services are provided by means of dedicated service gateways, through which traffic flows are directed. Existing work on service gateway placement has been primarily focused on minimizing the length of the routes through these gateways. Only limited attention has been paid to the effect these routes have on overall network performance. We propose a novel approach for the service placement problem, which takes into account traffic engineering considerations. Rather than trying to minimize the length of the traffic flow routes, we take advantage of these routes in order to enhance the overall network performance. We divide the problem into two subproblems: finding the best location for each service gateway, and selecting the best service gateway for each flow. We propose efficient algorithms for both problems and study their performance. Our main contribution is showing that placement and selection of network services can be used as effective tools for traffic engineering.     

Translucent optical networks: the way forward [Topics in Optical Communications]

The transmission reach of signals in optical transmission systems is limited. To go beyond these transparent reach limits, signal regeneration is necessary to re-amplify, reshape, and retime the optical signals. Translucent optical networks are a type of optical transport network specifically devised to address such a concern by allowing for sparse but strategic signal regeneration in the network. Translucent optical networks seek a graceful balance between network design cost and service provisioning performance, and can achieve performance comparable to that of an all-electronic switching network, but requiring far fewer signal regenerators. Despite massive progress, there are many outstanding issues regarding the implementation of translucent networks planning and operation. This article reviews a range of translucent optical networks and discusses various research issues, particularly involving network planning, lightpath routing and wavelength assignment, and network survivability. We also suggest other potential research topics such as traffic grooming, fault detection, and multicasting for translucent networks     

Efficient distributed restoration path selection for shared mesh restoration

In MPLS/GMPLS networks, a range of restoration schemes will be required to support different tradeoffs between service interruption time and network resource utilization. In light of these tradeoffs, path-based end-to-end shared mesh restoration provides a very attractive solution. However, efficient use of bandwidth for shared mesh restoration strongly relies on the procedure for selecting restoration paths. We propose an efficient restoration path selection algorithm for restorable connections over shared bandwidth in a fully distributed MPLS/GMPLS architecture. We also describe how to extend MPLS/GMPLS signaling protocols to collect the necessary information efficiently. To evaluate the algorithm's performance, we compare it via simulation with two other well-known algorithms on a typical intercity backbone network. The key figure of merit for restoration bandwidth efficiency is restoration overbuild, i.e., the extra bandwidth required to meet the network restoration objective as a percentage of the bandwidth of the network with no restoration. Our simulation results show that our algorithm uses significantly less restoration overbuild (63%-68%) compared with the other two algorithms (83%-90%).