Cost Analysis of BestRelay Retransmission Trees for Reliable Multicasting

Chang-Han KIM
Jae-Heon YANG
Ikjun YEOM

Publication
IEICE TRANSACTIONS on Communications   Vol.E90-B    No.3    pp.527-537
Publication Date: 2007/03/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e90-b.3.527
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
Keyword: 
upper-bound,  IP multicast,  reliable multicast,  retransmission tree,  

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


Summary: 
In this paper, we address how to construct efficient retransmission trees for reliable multicast. Efficiency of retransmission trees mainly depends on locations of repairers, which are in charge of retransmitting lost packets. We propose an algorithm for each receiver to find a repairer for efficient recovery. The resulting tree for retransmission is organized by pairs of a receiver and a repairer which is the host "nearest" to the receiver among the multicast group members "nearer" to the sender. We formally prove that the proposed algorithm realizes reliable multicast with only constant times of a lower bound cost achievable through impractical router support. We also evaluate the algorithm through extensive simulations.