Multi-path routing scheme for non-interactive multicast communications

Authors:
R. Srinivasan;V. Vaidehi;N. Ranjani;M. Sathya;D. Subramani
Affiliations:
Department of Electronics Engineering, MIT Campus of Anna University, Chennai, India;Department of Electronics Engineering, MIT Campus of Anna University, Chennai, India;Department of Electronics Engineering, MIT Campus of Anna University, Chennai, India;Department of Electronics Engineering, MIT Campus of Anna University, Chennai, India;Department of Electronics Engineering, MIT Campus of Anna University, Chennai, India
Venue:
International Journal of Network Management
Year:
2007

Citing 7
Cited 1

Principles of Wireless Networks: A Unified Approach

Principles of Wireless Networks: A Unified Approach
Survey of multicast routing algorithms and protocols

ICCC '02 Proceedings of the 15th international conference on Computer communication
Alternate path routing for multicast

IEEE/ACM Transactions on Networking (TON)
MuSeQoR: multi-path failure-tolerant security-aware qos routing in ad hoc wireless networks

HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Analysis of multipath Routing-Part I: the effect on the packet delivery ratio

IEEE Transactions on Wireless Communications
Multicast routing and its QoS extension: problems, algorithms, and protocols

IEEE Network: The Magazine of Global Internetworking
Multicast routing algorithms and protocols: a tutorial

IEEE Network: The Magazine of Global Internetworking

Network-coding-based cache policy for loss recovery enhancement in reliable multicast

International Journal of Network Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 members to join 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.