The study of shared-path protection algorithms with SRLG constraint in WDM mesh network

Pei Zhang; Yanlei Zheng; Yu Deng; Wanyi Gu

doi:10.1117/12.743718

19 November 2007 The study of shared-path protection algorithms with SRLG constraint in WDM mesh network

Pei Zhang, Yanlei Zheng, Yu Deng, Wanyi Gu

Proceedings Volume 6784, Network Architectures, Management, and Applications V; 67840Z (2007) https://doi.org/10.1117/12.743718
Event: Asia-Pacific Optical Communications, 2007, Wuhan, China

Abstract

Network survivability has been one of the key topics when researching the optical network. For network survivability, select two routes should be selected that are disjoint when computing the working route and protecting route or restoring route. The purpose of the shared-protection algorithms under Shared Risk Link Group (SRLG) constraint is to search two routes that are disjoint from SRLG. Two shared-protection algorithms under Shared Risk Link Group (SRLG) constraint will be presented; they are KWFF and IFF algorithms. In the KWFF algorithm, the K-Shortest- Path (KSP) strategy is introduced on every wavelength plane to search usable resources adequately in the network, the working route and protecting route on every wavelength plane can be selected from the backup route set. And with the iterative strategy and the double weights of link, IFF algorithm could avoid the trap that can result in deteriorating the network performance. The simulation and results analysis will be in terms of two parts, the one is from the network performance, and other one is from the resources utilization. From the simulation results, it will be found that compared with other algorithms, KWFF and IFF algorithms could decrease the block probability and improve the performance in the network.

Citation Download Citation

Pei Zhang, Yanlei Zheng, Yu Deng, and Wanyi Gu "The study of shared-path protection algorithms with SRLG constraint in WDM mesh network", Proc. SPIE 6784, Network Architectures, Management, and Applications V, 67840Z (19 November 2007); https://doi.org/10.1117/12.743718

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available