Survivable lightpath provisioning in WDM mesh networks under shared path protection and signal quality constraints

Yang, Xi; Shen, Lu; Ramamurthy, Byrav

doi:10.1109/jlt.2005.844495

Cited by 78 publications

(39 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Survivability further increases the complexity of the design of optical WDM networks. Survivable design of WDM networks under static traffic was studied in [14], [15], [16], [17], [18], [19], [20], and [21]. Most of the current approaches solve the survivable routing problem in WDM networks either by directly solving complex ILP formulations that are extremely time consuming or by using heuristics or meta heuristics such as tabu-search, which do not provide any guarantee on the optimality of the solution obtained.…”

mentioning

confidence: 99%

Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Todimala

Ramamurthy

2006

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications

Self Cite

View full text Add to dashboard Cite

Abstract-Multicommodity flow (MF) problems have a wide variety of applications in areas such as VLSI circuit design, network design, etc., and are therefore very well studied. The fractional MF problems are polynomial time solvable while integer versions are N P-complete. However, exact algorithms to solve the fractional MF problems have high computational complexity. Therefore approximation algorithms to solve the fractional MF problems have been explored in the literature to reduce their computational complexity. Using these approximation algorithms and the randomized rounding technique, polynomial time approximation algorithms have been explored in the literature.In the design of high-speed networks, such as optical wavelength division multiplexing (WDM) networks, providing survivability carries great significance. Survivability is the ability of the network to recover from failures.It further increases the complexity of network design and presents network designers with more formidable challenges.In this work we formulate the survivable versions of the MF problems. We build approximation algorithms for the survivable multicommodity flow (SMF) problems based on the framework of the approximation algorithms for the MF problems presented in [1] and [2]. We discuss applications of the SMF problems to solve survivable routing in capacitated networks.

show abstract

mentioning

confidence: 99%

Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Todimala

Ramamurthy

2006

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications

Self Cite

View full text Add to dashboard Cite

show abstract

“…A similar heuristic exploiting routing history instead of agents is presented in (Marin et al 2007). Other heuristics applicable to perform IA-RWA include the genetic algorithm as proposed in (Ali et al 1999;Lima et al 2003), stimulated annealing (Mukherjee et al 1996) and taboo search (Yan et al 2001;Yang et al 2005). These cannot be implemented or distributed and are computationally exhaustive, but are capable to accurately approach the global optimum with increasing computation effort.…”

Section: Ant Colony Optimisationmentioning

confidence: 99%

“…There is no way to formally check problem sanity and completeness; that needs to be done by the engineer manually. Many proposals to solve IA-RWA using ILP have been published (Yang et al 2005;Tomkos et al 2004b;Cugini et al 2007). They differ in the type and number of constraints considered, the optimisation target, considered routing demands and network scenario.…”

Section: Ilp-based Ia-rwamentioning

confidence: 99%

Signal Processing, Management and Monitoring in Transmission Networks

Vázquez

Montalvo

Ahmed

et al. 2011

Optical Transmission

View full text Add to dashboard Cite

1higher, linear and non-linear fibre impairments become prominent factors affecting the signal quality. Thus, new techniques in both physical layer and network layer are necessary for mitigating impairments to accommodate high-speed traffic (Tomkos et al. 2002). On the other hand, the flexibility of modern networks with dynamic and distributed management, where lightpaths can be dynamically and automatically assigned end-to-end, increases the risk of changing path conditions that affect signal quality and consequently quality of service (QoS) over the lifetime of a connection as well as for subsequent connection set-up requests (on-demand routing and wavelength assignment -RWA). For traditional connection provisioning an ideal physical layer, ignoring transmission impairments (Chlamtac et al. 1992) could be assumed because the implicit per hop regeneration (optics-to-electronics-to-optics conversion -O/E/O) compensated signal impairments hop-by-hop in a rather static manner (section commissioning). For end-to-end all-optically switched connections using photonic cross-connect switches (PXC), the conditions change and common practice is not applicable. Anyhow, intelligent connection provisioning is an important traffic engineering problem, and minimising operational cost as well as efficiently utilising network resources is the main driver. In this context, it seems important to have flexible routing protocols that take into consideration the most relevant physical impairments, and are able to exchange messages with their values as part of the route information with others. This condition, if definitely used to calculate routing, will surely assure better success in data delivery over the network (Huang et al. 2005). Irrespective of the control architecture chosen by an operator of an optical network, the included control plane (in charge of setting up and tearing down optical circuits; also known as lightpaths) needs to have a proper set of tools to satisfyingly deal with physical impairments. The most essential tools are: optical signal monitoring, signal processing and impairment compensation techniques (each all-optically and/or electrically). With the help of these tools, it is possible to predict the QoT (quality of transmission) attainable for a lightpath at a given time (i.e. the latest network-wide monitoring instant), and the control plane can route requests across the network

show abstract

“…• Wavelength usage constraints, which have the same application as (11) and (12) in ILP-RWA-LU formulation…”

Section: ) Formulation Enhancementsmentioning

confidence: 99%

“…Then an IA-RWA algorithm is used to serve the converted demand set. Authors in [11] address the issue of shared protection in translucent WDM mesh networks with consid-eration for physical layer impairments. None of these works tackle scenarios with dedicated protected demands.…”

Section: Introductionmentioning

confidence: 99%

A Novel Offline Physical Layer Impairments Aware RWA Algorithm With Dedicated Path Protection Consideration

Azodolmolky

Klinkowski

Pointurier

et al. 2010

J. Lightwave Technol.

View full text Add to dashboard Cite

Abstract-Physical layer impairments accumulate as light propagates through a lightpath in the transparent optical networks. Therefore, it is possible to provision a lightpath, while its quality of transmission (QoT) does not meet the required threshold. Considering the physical layer impairments in the network planning phase gives rise to a set of offline Impairments Aware Routing and Wavelength Assignment (IA-RWA) algorithms. There are very few offline IA-RWA algorithms that consider dedicated path protection demands. In this work we propose a novel offline IA-RWA algorithm, called Rahyab and perform a comparative performance evaluation study, which considers two enhanced algorithms from the literature. Simulation results indicates that demand pre-processing, diverse routing, and adaptive wavelength assignment are the main reasons of lower blocking rate of Rahyab algorithm compared to the selected algorithms.Index Terms-Dedicated path protection, impairments aware RWA, physical layer impairments, routing and wavelength assignment.

show abstract

Survivable lightpath provisioning in WDM mesh networks under shared path protection and signal quality constraints

Cited by 78 publications

References 19 publications

Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Signal Processing, Management and Monitoring in Transmission Networks

A Novel Offline Physical Layer Impairments Aware RWA Algorithm With Dedicated Path Protection Consideration

Contact Info

Product

Resources

About