A new algorithm based on auxiliary virtual topology for sub-path protection in WDM optical networks

Authors:
Xingwei Wang;Lei Guo;Xuekui Wang;Yu Zhang;Xiaobing Zheng;Weigang Hou;Hongming Li;Hongpeng Wang
Affiliations:
College of Information Science and Engineering, Northeastern University, P.O. Box 365, Shenyang 110004, China;College of Information Science and Engineering, Northeastern University, P.O. Box 365, Shenyang 110004, China;College of Information Science and Engineering, Northeastern University, P.O. Box 365, Shenyang 110004, China;College of Information Science and Engineering, Northeastern University, P.O. Box 365, Shenyang 110004, China;College of Information Science and Engineering, Northeastern University, P.O. Box 365, Shenyang 110004, China;College of Information Science and Engineering, Northeastern University, P.O. Box 365, Shenyang 110004, China;College of Information Science and Engineering, Northeastern University, P.O. Box 365, Shenyang 110004, China;College of Information Science and Engineering, Northeastern University, P.O. Box 365, Shenyang 110004, China
Venue:
Computer Communications
Year:
2009

Citing 6
Cited 0

A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices

IEEE Transactions on Computers
Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

IEEE/ACM Transactions on Networking (TON)
Intelligent shared-segment protection

Computer Networks: The International Journal of Computer and Telecommunications Networking
A framework for service-guaranteed shared protection in WDM mesh networks

IEEE Communications Magazine
Novel algorithms for shared segment protection

IEEE Journal on Selected Areas in Communications
Survivability in optical networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper proposes a new survivable algorithm named sub-path protection based on auxiliary virtual topology (SPAVT) to tolerate the single-link failure in WDM optical networks. First, according to the protection-switching time constraint, SPAVT searches multiple pairs of primary and backup paths for each node pair in the network by the off-line manner, and then map these paths to the virtual topology. When a connection request arrives, SPAVT only needs to run one time of the Dijkstra's algorithm to search a virtual route in virtual topology, where the route may consist of multiple pairs of sub-paths, to meet the protection-switching time constraint. Then, according to the shared resources policy, SPAVT chooses an optimal pair of sub-paths. Simulation results show that SPAVT has smaller blocking probability and lower time complexity than conventional algorithms.