Cost analysis of BestRelay retransmission trees for reliable multicasting

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 405
  • Download : 0
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 reciever 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.
Publisher
IEICE-Inst Electronics Information Communications Eng
Issue Date
2007-03
Language
English
Article Type
Article
Citation

IEICE TRANSACTIONS ON COMMUNICATIONS, v.E90B, no.3, pp.527 - 537

ISSN
0916-8516
DOI
10.1093/ietcom/e90-b.3.527
URI
http://hdl.handle.net/10203/87334
Appears in Collection
RIMS Journal Papers
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0