A new heuristic routing algorithm with Hamiltonian Cycle Protection in survivable networks

Authors:
Lei Guo;Xingwei Wang;Juan Du;Tengfei Wu
Affiliations:
College of Information Science and Engineering, Northeastern University, Shenyang 110004, China and Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks, University of ...;College of Information Science and Engineering, Northeastern University, Shenyang 110004, China;College of Information Science and Engineering, Northeastern University, Shenyang 110004, China;College of Information Science and Engineering, Northeastern University, Shenyang 110004, China
Venue:
Computer Communications
Year:
2008

Citing 5
Cited 1

Shared protection in mesh WDM networks

IEEE Communications Magazine
Automatic protection switching for p-cycles in WDM networks

Optical Switching and Networking
Extending the p-cycle concept to path segment protection for span and node failure recovery

IEEE Journal on Selected Areas in Communications
Physical-Layer p-Cycles Adapted for Router-Level Node Protection: A Multi-Layer Design and Operation Strategy

IEEE Journal on Selected Areas in Communications
Hamiltonian p-cycles for fiber-level protection in semi-homogeneous homogeneous and optical networks

IEEE Network: The Magazine of Global Internetworking

Preplanned restoration of multicast demands in optical networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.24

Visualization

Abstract

In high speed backbone networks, the survivability is a very important issue since the networks carry a lot of traffic. In this paper, we study the protection method with Hamiltonian Cycle in meshed survivable backbone networks, and proposed a new heuristic routing algorithm called Enhanced Hamiltonian Cycle Protection (EHCP) to tolerate the single failure. In EHCP, for each connection request the working path can be effectively selected based on the presented link-cost functions that consider the different affection for backup resources from on-cycle links and straddling links so that the backup resources on the protecting Hamiltonian Cycle can be reduced. The simulation results show that, compared with the conventional Hamiltonian Cycle Protection algorithm, EHCP can obtain significant improvement in resource utilization ratio.