Construction of a Robust Multicast Tree for Application-Level Multicast

Taku NOGUCHI
Miki YAMAMOTO

Publication
IEICE TRANSACTIONS on Communications   Vol.E88-B    No.12    pp.4427-4434
Publication Date: 2005/12/01
Online ISSN: 
DOI: 10.1093/ietcom/e88-b.12.4427
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (IEICE/IEEE Joint Special Section on Autonomous Decentralized Systems)
Category: Multicast
Keyword: 
IP multicast,  application-level multicast,  overlay network,  P2P,  

Full Text: PDF(350.3KB)>>
Buy this Article


Summary: 
Application-level multicast (ALM) is a feasible alternative to IP multicast. In ALM, multicast related features, such as group membership management, multicast routing and packet replication, are implemented at end-hosts instead of routers. A multicast distribution tree is constructed in the application layer, so all nodes in this tree are end-hosts. Packet transmission between end-hosts uses conventional IP unicast service. Therefore, all end-hosts can enjoy multicast communications without IP multicast service. However, ALM has a serious problem that the multicast distribution tree is intrinsically fragile and an end-host failure causes tree partitions. In this paper, to deal with this problem, we propose a new tree construction protocol which makes outdegrees of intermediate nodes be balanced. The degree-balanced distribution tree can reduce the average number of nodes decoupled by tree partitions. To investigate performance of our protocol, it is compared with an existing ALM protocol. Our simulation results show that our protocol outperforms the existing protocol from the viewpoints of robustness, loss probability and receiver-perceived delay.