The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A abordagem baseada em árvore provou ser mais escalável para multicast confiável de um para muitos. Ele combina de forma eficiente a recuperação distribuída com a recuperação local em uma árvore lógica do remetente e dos destinatários. Também se sabe que o desempenho dos protocolos baseados em árvore depende fortemente da qualidade da árvore lógica. Neste artigo, propomos um esquema ponta a ponta para melhorar ainda mais a escalabilidade da abordagem baseada em árvore. Ao trocar informações de perda de pacotes observadas nos hosts finais, o esquema constrói e mantém uma árvore lógica congruente com a árvore de roteamento multicast subjacente, mesmo na presença de membros de sessão e alterações de rota multicast. O esquema também agrupa os nós da árvore e atribui endereços multicast separados a eles, a fim de permitir uma retransmissão multicast eficiente para reduzir o atraso e a exposição. Comparamos o esquema proposto com o Tree-based Multicast Transport Protocol (TMTP), um protocolo estático baseado em árvore. Extensas simulações de até 300 sessões de nós revelam que o esquema proposto reduz a implosão e a exposição em mais de 20% e 50%, respectivamente. Os resultados também indicam que o esquema é altamente escalável, de modo que a melhoria se torna mais significativa à medida que o tamanho da sessão aumenta.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -