Dynamic sub-path protection with hop constraint routing algorithm in WDM networks

Jin Cao; Hongfang Yu; Lemin Li

doi:10.1117/12.634974

5 December 2005 Dynamic sub-path protection with hop constraint routing algorithm in WDM networks

Jin Cao, Hongfang Yu, Lemin Li

Proceedings Volume 6022, Network Architectures, Management, and Applications III; 60224L (2005) https://doi.org/10.1117/12.634974
Event: Asia-Pacific Optical Communications, 2005, Shanghai, China

Abstract

The survivable design is a key issue in reliable WDM optical networks to assure the service guarantee to customers. In this paper we propose a novel heuristic dynamic Sub-Path Protection with Hop Constraint routing algorithm (SPP-HC) to provide a more flexible way to compute the sub-paths and the backup paths. Compared with the conventional equal-length sub-path protection metrics, SPP-HC can further improve the resource utilization ratio and reduce the blocking probability. We evaluate the effectiveness of the SPP-HC and the results are found to be promising.

Citation Download Citation

Jin Cao, Hongfang Yu, and Lemin Li "Dynamic sub-path protection with hop constraint routing algorithm in WDM networks", Proc. SPIE 6022, Network Architectures, Management, and Applications III, 60224L (5 December 2005); https://doi.org/10.1117/12.634974

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