We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Survivable multipath routing using link penalization

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
$31 $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

3 Author(s)
Dong-won Shin ; Technol. Lab., KT, Daejun, South Korea ; Chong, E.K.P. ; Siegel, H.J.

Most previous schemes for survivable routing assume that the maximum number of simultaneous link failures is known. In this paper, we take an alternative approach by introducing link failure probabilities to the routing problem, and allowing each link to be used for several channels. Based on these assumptions, we formulate a survivable multipath routing problem for point-to-point communications. We then develop two heuristic multipath routing schemes for this problem: CPMR (conditional-penalization multipath routing) and SPMR (successive-penalization multipath routing). To deal with the difficulty that link-sharing causes, our schemes use "link penalization" methods to control (but not prohibit) link-sharing. We show via simulation that our schemes have significantly higher routing success rates than a routing scheme that searches for disjoint paths.

Published in:

Performance, Computing, and Communications, 2004 IEEE International Conference on

Date of Conference: