Performance Evaluation of Dynamic Tree-Based Reliable Multicast
Summary :
Due to the pruning and joining of members, multicast groups are dynamic. Both the topology and the total number of links change during multicast sessions, and the multicast performance, measured in terms of the bandwidth consumption, will change accordingly. In this paper, we investigate the dynamic performance of multicast communication with homogeneous packet loss probability; indeed, we evaluate the effects of the pruning of receivers and of subnets, after which we find the optimal placements of repair servers. A new 3-phase algorithm for adapting the optimal repair server placements to the dynamic changes of network topologies is presented and analyzed.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E88-B No.5 pp.2035-2045
- Publication Date
- 2005/05/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietcom/e88-b.5.2035
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Zuo Wen WAN, Michel KADOCH, Ahmed ELHAKEEM, "Performance Evaluation of Dynamic Tree-Based Reliable Multicast" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 5, pp. 2035-2045, May 2005, doi: 10.1093/ietcom/e88-b.5.2035.
Abstract: Due to the pruning and joining of members, multicast groups are dynamic. Both the topology and the total number of links change during multicast sessions, and the multicast performance, measured in terms of the bandwidth consumption, will change accordingly. In this paper, we investigate the dynamic performance of multicast communication with homogeneous packet loss probability; indeed, we evaluate the effects of the pruning of receivers and of subnets, after which we find the optimal placements of repair servers. A new 3-phase algorithm for adapting the optimal repair server placements to the dynamic changes of network topologies is presented and analyzed.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.5.2035/_p
Copy
@ARTICLE{e88-b_5_2035,
author={Zuo Wen WAN, Michel KADOCH, Ahmed ELHAKEEM, },
journal={IEICE TRANSACTIONS on Communications},
title={Performance Evaluation of Dynamic Tree-Based Reliable Multicast},
year={2005},
volume={E88-B},
number={5},
pages={2035-2045},
abstract={Due to the pruning and joining of members, multicast groups are dynamic. Both the topology and the total number of links change during multicast sessions, and the multicast performance, measured in terms of the bandwidth consumption, will change accordingly. In this paper, we investigate the dynamic performance of multicast communication with homogeneous packet loss probability; indeed, we evaluate the effects of the pruning of receivers and of subnets, after which we find the optimal placements of repair servers. A new 3-phase algorithm for adapting the optimal repair server placements to the dynamic changes of network topologies is presented and analyzed.},
keywords={},
doi={10.1093/ietcom/e88-b.5.2035},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Performance Evaluation of Dynamic Tree-Based Reliable Multicast
T2 - IEICE TRANSACTIONS on Communications
SP - 2035
EP - 2045
AU - Zuo Wen WAN
AU - Michel KADOCH
AU - Ahmed ELHAKEEM
PY - 2005
DO - 10.1093/ietcom/e88-b.5.2035
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2005
AB - Due to the pruning and joining of members, multicast groups are dynamic. Both the topology and the total number of links change during multicast sessions, and the multicast performance, measured in terms of the bandwidth consumption, will change accordingly. In this paper, we investigate the dynamic performance of multicast communication with homogeneous packet loss probability; indeed, we evaluate the effects of the pruning of receivers and of subnets, after which we find the optimal placements of repair servers. A new 3-phase algorithm for adapting the optimal repair server placements to the dynamic changes of network topologies is presented and analyzed.
ER -
English
