A heuristic algorithm for shared segment protection in mesh WDM networks with limited backup path/segments length

Authors:
Hongbin Luo;Hongfang Yu;Lemin Li
Affiliations:
Key Lab of Broadband Optical Transmission and Communication Networks University of Electronic Science and Technology of China, Chengdu 610054, China;Key Lab of Broadband Optical Transmission and Communication Networks University of Electronic Science and Technology of China, Chengdu 610054, China;Key Lab of Broadband Optical Transmission and Communication Networks University of Electronic Science and Technology of China, Chengdu 610054, China
Venue:
Computer Communications
Year:
2006

Citing 10
Cited 0

An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks

IEEE/ACM Transactions on Networking (TON)
Allocation of Protection Domains in Dynamic WDM Mesh Networks

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Efficient distributed restoration path selection for shared mesh restoration

IEEE/ACM Transactions on Networking (TON)
Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

IEEE/ACM Transactions on Networking (TON)
A framework for service-guaranteed shared protection in WDM mesh networks

IEEE Communications Magazine
Path vs. subpath vs. link restoration for fault management in IP-over-WDM networks: performance comparisons using GMPLS control signaling

IEEE Communications Magazine
Novel algorithms for shared segment protection

IEEE Journal on Selected Areas in Communications
Routing bandwidth guaranteed paths with local restoration in label switched networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper investigates the problem of dynamic survivable lightpath provisioning against single-link failure in optical mesh networks employing wavelength-division multiplexing (WDM). We focus on the special problem of provisioning lightpath requests according to their differentiated protection-switching time, since lightpath may have different protection-switching time requirements. We assume that the protection-switching time requirements of connections can be transformed to the hop limits of backup path/segments by using techniques proposed in the literature such as [Y. Luo, N. Ansari, Survivable GMPLS networks with QoS guarantees, IEE Proc. Commun., vol. 152, (4) (2005) 427-431]. We propose a heuristic algorithm, namely Suurballe-based Heuristic Algorithm using Least number of segments for SSP with hop Limit (SHALL), to efficiently solve this problem. We inspect the effects of hop limit on various performance matrices and compare the SHALL approach with three other well-known protection approaches, namely shared path protection (SPP), shared link based protection (LBP) and cascaded diverse routing (CDR). Numerical results demonstrate that the SHALL approach outperforms its counterparts in blocking probability and protection-switching time with mirror decrease of spare capacity efficiency.