Enhancing Scalability of Tree-Based Reliable Multicast by Approximating Logical Tree to Multicast Routing Tree

Dongman LEE; Wonyong YOON; Hee Yong YOUN

Enhancing Scalability of Tree-Based Reliable Multicast by Approximating Logical Tree to Multicast Routing Tree

Dongman LEE, Wonyong YOON, Hee Yong YOUN

Full Text Views

0

Cite this

Summary :

Tree-based approach has been proven to be most scalable for one-to-many reliable multicast. It efficiently combines distributed recovery with local recovery over a logical tree of the sender and receivers. It has also been known that the performance of the tree-based protocols heavily depends upon the quality of the logical tree. In this paper, we propose an end-to-end scheme to further enhance the scalability of the tree-based approach. By exchanging packet loss information observed at the end hosts, the scheme constructs and maintains a logical tree congruent with the underlying multicast routing tree even in the presence of session membership and multicast route changes. The scheme also groups the tree nodes and assigns separate multicast addresses to them in order to enable efficient multicast retransmission for reducing both delay and exposure. We compare the proposed scheme with Tree-based Multicast Transport Protocol (TMTP), a static tree-based protocol. Extensive simulations up to 300 node sessions reveal that the proposed scheme reduces implosion and exposure more than 20% and 50%, respectively. The results also indicate that the scheme is highly scalable such that the improvement gets more significant as the size of the session increases.

Publication: IEICE TRANSACTIONS on Communications Vol.E84-B No.10 pp.2850-2862

Publication Date: 2001/10/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Internet

Cite this

Copy

Dongman LEE, Wonyong YOON, Hee Yong YOUN, "Enhancing Scalability of Tree-Based Reliable Multicast by Approximating Logical Tree to Multicast Routing Tree" in IEICE TRANSACTIONS on Communications, vol. E84-B, no. 10, pp. 2850-2862, October 2001, doi: .
Abstract: Tree-based approach has been proven to be most scalable for one-to-many reliable multicast. It efficiently combines distributed recovery with local recovery over a logical tree of the sender and receivers. It has also been known that the performance of the tree-based protocols heavily depends upon the quality of the logical tree. In this paper, we propose an end-to-end scheme to further enhance the scalability of the tree-based approach. By exchanging packet loss information observed at the end hosts, the scheme constructs and maintains a logical tree congruent with the underlying multicast routing tree even in the presence of session membership and multicast route changes. The scheme also groups the tree nodes and assigns separate multicast addresses to them in order to enable efficient multicast retransmission for reducing both delay and exposure. We compare the proposed scheme with Tree-based Multicast Transport Protocol (TMTP), a static tree-based protocol. Extensive simulations up to 300 node sessions reveal that the proposed scheme reduces implosion and exposure more than 20% and 50%, respectively. The results also indicate that the scheme is highly scalable such that the improvement gets more significant as the size of the session increases.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_10_2850/_p

Copy

@ARTICLE{e84-b_10_2850,
author={Dongman LEE, Wonyong YOON, Hee Yong YOUN, },
journal={IEICE TRANSACTIONS on Communications},
title={Enhancing Scalability of Tree-Based Reliable Multicast by Approximating Logical Tree to Multicast Routing Tree},
year={2001},
volume={E84-B},
number={10},
pages={2850-2862},
abstract={Tree-based approach has been proven to be most scalable for one-to-many reliable multicast. It efficiently combines distributed recovery with local recovery over a logical tree of the sender and receivers. It has also been known that the performance of the tree-based protocols heavily depends upon the quality of the logical tree. In this paper, we propose an end-to-end scheme to further enhance the scalability of the tree-based approach. By exchanging packet loss information observed at the end hosts, the scheme constructs and maintains a logical tree congruent with the underlying multicast routing tree even in the presence of session membership and multicast route changes. The scheme also groups the tree nodes and assigns separate multicast addresses to them in order to enable efficient multicast retransmission for reducing both delay and exposure. We compare the proposed scheme with Tree-based Multicast Transport Protocol (TMTP), a static tree-based protocol. Extensive simulations up to 300 node sessions reveal that the proposed scheme reduces implosion and exposure more than 20% and 50%, respectively. The results also indicate that the scheme is highly scalable such that the improvement gets more significant as the size of the session increases.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - Enhancing Scalability of Tree-Based Reliable Multicast by Approximating Logical Tree to Multicast Routing Tree
T2 - IEICE TRANSACTIONS on Communications
SP - 2850
EP - 2862
AU - Dongman LEE
AU - Wonyong YOON
AU - Hee Yong YOUN
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2001
AB - Tree-based approach has been proven to be most scalable for one-to-many reliable multicast. It efficiently combines distributed recovery with local recovery over a logical tree of the sender and receivers. It has also been known that the performance of the tree-based protocols heavily depends upon the quality of the logical tree. In this paper, we propose an end-to-end scheme to further enhance the scalability of the tree-based approach. By exchanging packet loss information observed at the end hosts, the scheme constructs and maintains a logical tree congruent with the underlying multicast routing tree even in the presence of session membership and multicast route changes. The scheme also groups the tree nodes and assigns separate multicast addresses to them in order to enable efficient multicast retransmission for reducing both delay and exposure. We compare the proposed scheme with Tree-based Multicast Transport Protocol (TMTP), a static tree-based protocol. Extensive simulations up to 300 node sessions reveal that the proposed scheme reduces implosion and exposure more than 20% and 50%, respectively. The results also indicate that the scheme is highly scalable such that the improvement gets more significant as the size of the session increases.
ER -