Cost Analysis of BestRelay Retransmission Trees for Reliable Multicasting

Chang-Han KIM; Jae-Heon YANG; Ikjun YEOM

doi:10.1093/ietcom/e90-b.3.527

Cost Analysis of BestRelay Retransmission Trees for Reliable Multicasting

Chang-Han KIM, Jae-Heon YANG, Ikjun YEOM

Full Text Views

0

Share
Cite this

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E90-B No.3 pp.527-537

Publication Date: 2007/03/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e90-b.3.527

Type of Manuscript: PAPER

Category: Network

Cite this

Copy

Chang-Han KIM, Jae-Heon YANG, Ikjun YEOM, "Cost Analysis of BestRelay Retransmission Trees for Reliable Multicasting" in IEICE TRANSACTIONS on Communications, vol. E90-B, no. 3, pp. 527-537, March 2007, doi: 10.1093/ietcom/e90-b.3.527.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.3.527/_p

Copy

@ARTICLE{e90-b_3_527,
author={Chang-Han KIM, Jae-Heon YANG, Ikjun YEOM, },
journal={IEICE TRANSACTIONS on Communications},
title={Cost Analysis of BestRelay Retransmission Trees for Reliable Multicasting},
year={2007},
volume={E90-B},
number={3},
pages={527-537},
abstract={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.},
keywords={},
doi={10.1093/ietcom/e90-b.3.527},
ISSN={1745-1345},
month={March},}

Copy

TY - JOUR
TI - Cost Analysis of BestRelay Retransmission Trees for Reliable Multicasting
T2 - IEICE TRANSACTIONS on Communications
SP - 527
EP - 537
AU - Chang-Han KIM
AU - Jae-Heon YANG
AU - Ikjun YEOM
PY - 2007
DO - 10.1093/ietcom/e90-b.3.527
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2007
AB - 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.
ER -