By Topic

Fault recovery for a distributed SP-based delay constrained multicast routing algorithm

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

2 Author(s)
Ural, H. ; Sch. of Inf. Technol. & Eng., Ottawa Univ., Ont., Canada ; Zhu, K.

This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree when node,failures occur during the tree construction period and recovering from any node failure in a multicast tree during the on-going multicast session without interrupting the running traffic on the unaffected portion of the tree. The proposed algorithm performs the failure recovery efficiently, which gives better performance in terms of the number of exchanged messages and the convergence time than the existing distributed SP-based delay constrained multicast routing algorithms in a network where node failures occur.

Published in:

Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM

Date of Conference:

15-19 April 2001