A novel recursive shared segment protection algorithm in survivable WDM networks

Authors:
Jin Cao;Lei Guo;Hongfang Yu;Lemin Li
Affiliations:
Key Lab of Broadband Optical Fiber Transmission and Communication Networks University/Corp., University of Electronic Science and Technology of China, Chengdu 610054, China;Key Lab of Broadband Optical Fiber Transmission and Communication Networks University/Corp., University of Electronic Science and Technology of China, Chengdu 610054, China;Key Lab of Broadband Optical Fiber Transmission and Communication Networks University/Corp., University of Electronic Science and Technology of China, Chengdu 610054, China;Key Lab of Broadband Optical Fiber Transmission and Communication Networks University/Corp., University of Electronic Science and Technology of China, Chengdu 610054, China
Venue:
Journal of Network and Computer Applications
Year:
2007

Citing 7
Cited 0

Dynamic Sub-mesh Protection under Dynamic Traffic Demands in Dense WDM Networks

AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2
Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

IEEE/ACM Transactions on Networking (TON)
A new path protection algorithm for meshed survivable wavelength-division-multiplexing networks

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Novel algorithms for shared segment protection

IEEE Journal on Selected Areas in Communications
A novel survivable routing algorithm for shared segment protection in mesh WDM networks with partial wavelength conversion

IEEE Journal on Selected Areas in Communications
Subpath protection for scalability and fast recovery in optical WDM mesh networks

IEEE Journal on Selected Areas in Communications
A review of fault management in WDM mesh networks: basic concepts and research challenges

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the problem of dynamic survivable routing for shared segment protection in mesh Wavelength-Division-Multiplexing (WDM) optical networks. We propose a heuristic algorithm, named Recursive Shared Segment Protection (RSSP), to introduce a more flexible way to partition the working path into segments and compute the corresponding backup segments. In RSSP, the working segments cannot be determined before the backup segments are found, we adopt a recursive process to compute the backup segments one by one and then choose an optimized way to partition the working path. The calculations of every neighbor working segment and its backup segment are connected with each other. We constrain the hop count for each backup segment to insure the short failure recovery time and control the bandwidth resource utilization. Compared with the Share Path Protection (SPP), RSSP can achieve much shorter failure recovery time with a little sacrifice in bandwidth resource utilization and RSSP can also perform better compromise between the failure recovery time and the bandwidth resource utilization than the Equal-Length Segment Protection (ELSP) algorithm. We evaluate the effectiveness of RSSP and the results are found to be promising.