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.     

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.      

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.     

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.

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.     

Regenerator Placement and Traffic Engineering with Restoration in GMPLS Networks

In this paper, we study regenerator placement and traffic engineering of restorable paths in generalized multiprotocol label switching (GMPLS) networks. Regenerators are necessary in optical networks in order to cope with transmission impairments. We study a network architecture where regenerators are placed only at selected nodes for decreasing cost of regeneration. We propose two heuristic algorithms for optimum placement of these regenerators. Performances of these algorithms in terms of required number of regenerators and computational complexity are evaluated. In this network architecture with sparse regeneration, off-line computation of working and restoration paths is studied for traffic engineering with path rerouting as the restoration scheme. We study two approaches for selecting working and restoration paths from a set of candidate paths and formulate each method as an integer linear programming (ILP) problem. A traffic uncertainty model is developed in order to compare these methods based on their robustness with respect to changing traffic patterns. Traffic engineering methods are compared based on number of additional demands resulting from traffic uncertainties that can be carried over the network. Proposed heuristic regenerator placement algorithms are also evaluated from a traffic engineering point of view.     

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.     

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     

GMPLS-controlled dynamic translucent optical networks

The evolution of optical technologies has paved the way to the migration from opaque optical networks (i.e., networks in which the optical signal is electronically regenerated at each node) to transparent (i.e., all-optical) networks. Translucent optical networks (i.e., optical networks with sparse opto-electronic regeneration) enable the exploitation of the benefits of both opaque and transparent networks while providing a suitable solution for dynamic connections. Translucent optical networks with dynamic connections can be controlled by the GMPLS protocol suite. This article discusses the enhancements that the GMPLS suite requires for the control of dynamic translucent optical networks with quality of transmission guarantees. Such enhancements concern QoT-awareness and regenerator-awareness and can be achieved by collecting and disseminating the information on QoT and regenerator availability, respectively, and by efficiently leveraging such information for traffic engineering purposes. More specifically, the article proposes two distributed approaches, based on the routing protocol and the signaling protocol, for disseminating regenerator information in the GMPLS control plane. Moreover, three strategies are introduced to efficiently and dynamically designate the regeneration node(s) along the connection route. Routing and signaling approaches are compared in terms of blocking probability, setup time, and control plane load during provisioning and restoration.     

QoT-aware lightpath set-up in GMPLS-controlled WDM networks: A survey

GMPLS-controlled Wavelength Switched Optical Networks (WSON) often undergo upgrade in bit rate or in network element switching capability. In such a scenario many wavelength paths cannot be anymore considered pre-validated from the original network design phase. Thus, it is required to verify the quality of the optical path physical signal during path computation and signaling by considering the optical network impairments (e.g., attenuation, amplified spontaneous emission, etc.).In this paper, the general problem of impairment-aware path computation is presented and then solutions based on GMPLS extensions to be used during path set-up are considered. Specifically, an overview is presented where different approaches for implementing Quality of Transmission (QoT) estimation and QoT measurements in transparent networks are outlined. In addition, techniques for exploiting sparse regeneration in translucent networks are illustrated. Numerical results show that the proposed schemes are effective in finding or designating QoT-validated paths in only few set-up attempts when a fully transparent path is available. If the transparent path becomes unfeasible, the translucent approach is adopted showing how to optimally designate intermediate regenerators to satisfy the end-to-end QoT constraints.     

Impairment constraint multicasting in translucent WDM networks: architecture, network design and multicasting routing

The popularity of broadband streaming applications requires communication networks to support high-performance multicasting at the optical layer. Suffering from transmission impairments in multi-hop all-optical (transparent) WDM multicasting networks, the signal may be degraded beyond the receivable margin at some multicast destinations. To guarantee the signal quality, we introduce a translucent WDM multicasting network to regenerate the degraded signals at some switching nodes with electronic 3R (reamplification, reshaping and retiming) functionality. The translucent network is built by employing three kinds of multicasting capable switching architectures: (1) all-optical multicasting capable cross connect (oMC-OXC), (2) electronic switch and (3) translucent multicasting capable cross connect (tMC-OXC). Among them both the electronic switch and tMC-OXC are capable of electronic 3R regeneration. Furthermore, we propose a multicast-capable nodes placement algorithm based on regeneration weight, and two multicasting routing algorithms called nearest hub first and nearest on tree hub first to provide signal-quality guaranteed routes for the multicasting requests. The numerical simulation on two typical mesh networks shows that it is sufficient to equip 30% of the nodes or less with signal-regeneration capability to guarantee the signal quality.     

Practical Integrated Design Strategies for Opaque and All-Optical DWDM Networks: Optimization Models and Solution Procedures

Dense wavelength division multiplexing (DWDM) opaque networks use expensive optical/electrical/optical (O/E/O) conversion at each end of a fiber link. Several technological advances have been used in an attempt to reduce the O/E/O conversion cost component: improved optical amplifiers using distributed Raman amplification allow signals to traverse longer distances without amplification and/or regeneration; optical switches allow the signal to remain in the optical domain most of the time. Networks that use this equipment to eliminate some of the O/E/O conversions are called transparent or all-optical networks and benefit from reduced capital costs at the expense of operational costs and complexity in order to handle potential adjustments in traffic demand. In this investigation, we develop optimization-based algorithms for DWDM network design and traffic routing for both opaque and all-optical networks. This study compares the performance of AMPL/CPLEX implementations of both algorithms on realistically sized networks with up to 36 nodes and 67 links. In all test cases considered the all-optical network design is substantially less expensive than the traditional opaque network design with cost reductions in the range of 12% to 26%.     

Multicasting on translucent multicast capable WDM mesh networks

As multicast applications becoming widely popular, supporting multicast in wavelength division multiplexing (WDM) networks is an important issue. Currently, there are two schemes to support multicast in WDM networks. One scheme is opaque multicasting which replicate bit stream in electronic domain. And the other is transparent multicasting which replicate bit stream all optically by a light splitter. However, both of two schemes have drawbacks or difficulties. This paper investigates an alternate translucent multicasting scheme, in which a fraction of branch nodes replicate bit stream at electronic domain and the other branch nodes replicate bit stream all optically. Replicating bit stream at electronic domain will introduce electronic processing overhead and extra delay. To satisfy the delay requirement of multicast session, the maximum number of electronic hops of a multicast tree must be less than an upper bound. In this paper, a hop-constrained multicast routing heuristic algorithm called shortest path based hop-constrained multicast routing (SPHMR) is proposed. A series of simulations are conducted to evaluate the effectiveness of translucent multicasting scheme. Simulation results show that the translucent multicasting scheme achieve a good compromise between network performance and network cost as well as power losses caused by light splitting.     

Wavelength converter placement under different RWA algorithms in wavelength-routed all-optical networks

Sparse wavelength conversion and appropriate routing and wavelength assignment (RWA) algorithms are the two key factors in improving the blocking performance in wavelength-routed all-optical networks. It has been shown that the optimal placement of a limited number of wavelength converters in an arbitrary mesh network is an NP-complete problem. There have been various heuristic algorithms proposed in the literature, in which most of them assume that a static routing and random-wavelength assignment RWA algorithm is employed. However, the existing work shows that fixed-alternate routing and dynamic routing RWA algorithms can achieve much better blocking performance. Our study further demonstrates that the wavelength converter placement and RWA algorithms are closely related in the sense that a well-designed wavelength converter placement mechanism for a particular RWA algorithm might not work well with a different RWA algorithm. Therefore, the wavelength converter placement and the RWA have to be considered jointly. The objective of this paper is to investigate the wavelength converter placement problem under the fixed-alternate routing (FAR) algorithm and least-loaded routing (LLR) algorithm. Under the FAR algorithm, we propose a heuristic algorithm called minimum blocking probability first for wavelength converter placement. Under the LLR algorithm, we propose another heuristic algorithm called weighted maximum segment length. The objective of the converter placement algorithms is to minimize the overall blocking probability. Extensive simulation studies have been carried out over three typical mesh networks, including the 14-node NSFNET, 19-node EON, and 38-node CTNET. We observe that the proposed algorithms not only outperform existing wavelength converter placement algorithms by a large margin, but they also can achieve almost the same performance compared with full wavelength conversion under the same RWA algorithm.     

Distributed optical control plane for dynamic lightpath establishment in translucent optical networks based on reachability graph

In transparent optical networks, physical layer impairments (PLIs) incurred by non-ideal optical transmission media accumulate along an optical path, and the overall effect determines the optical feasibility of the lightpaths. In addition, transparent optical networks suffer from inefficient wavelength utilization, as a connection request may be rejected because of non-availability of a common wavelength on all the links along the chosen route. To increase optical reach, resource utilization, and average call acceptance ratio (and hence revenues), network operators are resort to translucent optical networks. In these networks a limited number of regenerators are placed at a selected set of nodes. In this scenario development of an optical control plane which is aware of PLIs, location and number of regenerators, is of paramount importance for on-demand lightpath provisioning. In this paper, we propose a novel approach of constructing a reachability graph of the physical network considering PLIs and regenerators. If there is no transparent path in the physical network, we route the connections with multiple transparent segments on the reachability graph. We propose efficient mechanisms and corresponding GMPLS protocol extensions for impairment and regenerator aware routing and wavelength assignment (IRA-RWA) in translucent optical networks. The simulation results suggest that our proposed approach together with LSP stitching signaling mechanism is feasible to implement and close to deployment.     

Dynamic circuit provisioning in all-optical WDM networks using lightpath switching

In this paper we investigate the problem of provisioning holding-time-aware (HTA) dynamic circuits in all-optical wavelength division multiplexed (WDM) networks. We employ a technique called lightpath switching (LPS) wherein the data transmission may begin on one lightpath and switch to a different lightpath at a later time. Lightpath switches are transparent to the user and are managed by the network. Allowing LPS creates a number of segments that can use independent lightpaths. We first compare the performance of traditional routing and wavelength (RWA) assignment to routing and wavelength assignment with LPS. We show that LPS can significantly reduce blocking compared to traditional RWA. We then address the problem of routing dynamic anycast HTA dynamic circuits. We propose two heuristics to solve the anycast RWA problem: anycast with continuous segment (ACS) and anycast with lightpath switching (ALPS). In ALPS we exercise LPS, and provision a connection request by searching for the best candidate destination node is such a way that the network resources are utilized efficiently. In ACS we do not allow a connection request to switch lightpaths. The lightpaths to each candidate destination node of a request are computed using traditional RWA algorithms. We first compare the performance of ACS to ALPS and observe that ALPS achieves better blocking than ACS. Furthermore, we also compare the performance of these two anycast RWA algorithms to the traditional unicast RWA algorithm. We show that the anycast RWA algorithms presented here significantly outperform the traditional unicast RWA algorithms.     

适合于波长路由光网的新型光转发器的设计

针对波长路由光网的特点 ,详细阐述了透明传输的优点及其限制因素 ,从而说明了城域网数据透明传输 ,而广域网中不透明传输的特性。在此基础上 ,提出了一种结构新颖的光转发器 ,并详细分析了其在未来波长路由光网中的具体应用。这种基于光电、电光转换的设备在桥接透明与不透明传输之间具有重要作用     

Sparse power equalization placement for limiting jamming attack propagation in transparent optical networks

The latest advances in Wavelength Division Multiplexing (WDM) technology are making it possible to build all-optical transparent WDM networks, which are expected to be able to satisfy the rapid growth of today’s capacity demand. However, the transparency of such networks makes them highly vulnerable to deliberate attacks, specifically targeting the physical layer. Physical-layer attacks, such as high-power jamming, can cause severe service disruption or even service denial, enhanced by their capability to propagate through a transparent optical network. Several attack-aware routing and wavelength assignment algorithms have been proposed to reduce the possible disruption caused by high-power jamming attacks. However, even with network planning approaches which take network security, specifically physical-layer attacks, into account, resilience to deliberate attacks in such scenarios remains an issue.In this paper, we propose the use of wavelength-selective attenuators as power equalizers inside network nodes to limit the propagation of high-power jamming attacks. Due to the increased cost of optical switching nodes associated with the addition of power equalizers, we aim at minimizing their number through sparse power equalization placement. We developed a set of greedy algorithms to solve what we call the Power Equalization Placement (PEP) problem with the objective of minimizing the number of power equalizers needed to reduce, to a desired level, the propagation of high-power jamming attacks for a given routing scheme. We further improved upon these results by proposing a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic with a somewhat longer execution time, but with significantly superior results. The performance evaluation results indicate that the proposed GRASP heuristic can achieve the same attack propagation reduction as can be obtained by equipping all nodes with power equalizers by placing them at less than 50% of the nodes on average, potentially yielding significant cost savings.     

Cross-Layer Design of ASE-Noise-Limited Island-Based Translucent Optical Networks

This paper considers the design and dimensioning of translucent optical networks based on the concept of optical transparent islands. In systems with dispersion compensation, amplified spontaneous emission (ASE) noise becomes a dominant physical-layer impairment in constraining the maximal transparent reach limit of a lightpath. Taking this dominant impairment into account, an efficient transparent island division algorithm is proposed to divide a large transport network into a few optical transparent islands and to minimize the total number of opaque island-border nodes. Optimization models for translucent network dimensioning are presented to maximize served traffic demand given certain network capacity and to minimize the required wavelength capacity given a certain traffic demand matrix. Simulation studies show that the proposed transparent island division approach and network-dimensioning optimization models require only 25% opaque nodes to overcome the constraint of transparent reach limit and achieve performance as good as that of a more expensive 100% opaque network.      

Sparse Wavelength Conversion in Wavelength-Routed WDM Optical Networks*

A wavelength-routed optical network can suffer inefficiencies due to the wavelength-continuity constraint (under which a signal has to remain on the same wavelength from the source to the destination). In order to eliminate or reduce the effects of this constraint, a device called a wavelength converter may be utilized. Due to the high cost of these wavelength converters, many studies have attempted to determine the exact benefits of wavelength conversion. However, most of these studies have focused on optical networks that implement full wavelength conversion capabilities. An alternative to full wavelength conversion is to employ only a sparse number of wavelength converters throughout the network, thereby reducing network costs. This study will focus on different versions of sparse wavelength conversion--namely, sparse nodal conversion, sparse switch-output conversion, and sparse (or limited) range conversion--to determine if most of the benefits of full conversion can be obtained using only sparse conversion. Simulation and analytical results on these three different classes of sparse wavelength conversion will be presented. In addition, this study will present heuristic techniques for the placement of sparse conversion facilities within an optical network.