A Fast and Efficient Explicit Multicast Routing Protocol

Mozafar BAG-MOHAMMADI  Nasser YAZDANI 

Publication
IEICE TRANSACTIONS on Communications  Vol.E88-B  No.10  pp.4000-4007
Publication Date: 2005/10/01
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
Keyword: 
explicit multicast,  small-size multicast, 

Full Text: PDF(283.9KB)

Summary: 
The state-oriented design of IP multicast may lead to the scalability problem, especially when there is a very large number of concurrent multicast groups in the network. Motivated by this problem, explicit multicast offers a stateless design using header space of multicast data packets. In this paper, we propose a novel stateless scheme called Linkcast that efficiently eliminates processing overhead of explicit multicast protocols. In Linkcast, the multicast sender encodes the tree listing its links in a proper way. The tree code is sent with every multicast data packet. Simulation results and experiments with real-trees show that Linkcast completely eliminates processing overhead of other explicit multicast protocols such as Xcast with comparable header size overhead.