Scheduled System Maintenance on December 17th, 2014:
IEEE Xplore will be upgraded between 2:00 and 5:00 PM EST (18:00 - 21:00) UTC. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Multi-Path Routing Scheme for Non-Interactive Multicast Communications

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

5 Author(s)
Srinivasan, R. ; Dept. of Electron. Eng., Anna Univ., Chennai, India ; Vaidehi, V. ; Ranjani, N. ; Sathya, M.
more authors

This paper proposes a multicast routing algorithm that makes use of multiple node-disjoint distribution trees for its routing from the source to the multicast group members. The specialty of this scheme is that the different packets of a message between a source and destinations are routed through node-disjoint paths to provide reliable and secure multicast communication. In this proposed routing scheme the computation of the node disjoint path for packet routing is done either at a centralized route moderator or in a distributed fashion at all destinations in order to avoid single point failure. An effective provision is made to enable new member join to the existing multicast trees and to prune leaving members. The performance parameters of the proposed reliable and secure multi path routing scheme are studied under various network conditions using GloMoSim.

Published in:

Communications and Electronics, 2006. ICCE '06. First International Conference on

Date of Conference:

10-11 Oct. 2006