By Topic

Link-Disjoint Shortest-Delay Path-Pair Computation Algorithms for Shared Mesh Restoration Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hassan Naser ; Faculty of Engineering, Lakehead University, Thunder Bay, Ontario, Canada. Email: hnaser@lakeheadu.ca ; Ming Gong

We present two novel double-constrained routing algorithms, called: Two-step Delay-constrained Pool Sharing (TDPS) and One-step Delay-constrained Pool Sharing (ODPS), in a survivable mesh network. The goal of both algorithms is to compute a pair of link-disjoint primary and backup paths between a given source and destination nodes, which guarantees full recovery from any single link failure in the network. Our objective is to minimize simultaneously the total end-to-end delay time along the primary and backup paths and the resources (such as backup bandwidth) used in the network. Using simulation, we have studied both TDPS and ODPS algorithms on three existing North-American transport networks. We show that the ODPS scheme eliminates the trap-topology problem associated with many two-step link-disjoint path computation algorithms proposed in the literature. It also outperforms TDPS in terms of the total end-to-end delay along the working and backup paths.

Published in:

Computers and Communications, 2007. ISCC 2007. 12th IEEE Symposium on

Date of Conference:

1-4 July 2007