覆盖组播树的构建与维护

T. M. Kwan, K. Yeung
{"title":"覆盖组播树的构建与维护","authors":"T. M. Kwan, K. Yeung","doi":"10.1109/COLCOM.2005.1651247","DOIUrl":null,"url":null,"abstract":"Overlay multicast tree construction and maintenance is a major challenge in designing application layer multicast protocols. In this paper, we focus on improving the joining and maintenance procedures of an overlay multicast tree. Unlike the existing direct-tree protocols, our proposed overlay multicast tree protocol (OMTP) has the following characteristics. First, by leveraging on the IP hierarchical addressing locality, we can speed up the formation of overlay multicast tree and enhance the efficiency of the tree maintenance. Second, we take both bandwidth availability and round-trip-time (RTT) into consideration when a newcomer selects its parent node. Finally, an effective mechanism is designed to disperse the simultaneous rejoin crowds in the tree repair phase. Simulation results show that with our proposed protocol, the join latency can be reduced by as large as 50% as compared with a popular direct-tree protocol HMTP","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On overlay multicast tree construction and maintenance\",\"authors\":\"T. M. Kwan, K. Yeung\",\"doi\":\"10.1109/COLCOM.2005.1651247\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Overlay multicast tree construction and maintenance is a major challenge in designing application layer multicast protocols. In this paper, we focus on improving the joining and maintenance procedures of an overlay multicast tree. Unlike the existing direct-tree protocols, our proposed overlay multicast tree protocol (OMTP) has the following characteristics. First, by leveraging on the IP hierarchical addressing locality, we can speed up the formation of overlay multicast tree and enhance the efficiency of the tree maintenance. Second, we take both bandwidth availability and round-trip-time (RTT) into consideration when a newcomer selects its parent node. Finally, an effective mechanism is designed to disperse the simultaneous rejoin crowds in the tree repair phase. Simulation results show that with our proposed protocol, the join latency can be reduced by as large as 50% as compared with a popular direct-tree protocol HMTP\",\"PeriodicalId\":365186,\"journal\":{\"name\":\"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COLCOM.2005.1651247\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COLCOM.2005.1651247","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

覆盖组播树的构建和维护是应用层组播协议设计的主要挑战。本文重点改进了覆盖组播树的连接和维护过程。与现有的直接树协议不同,我们提出的覆盖组播树协议(OMTP)具有以下特点:首先,利用IP分层寻址局部性,加快了覆盖组播树的形成速度,提高了树的维护效率。其次,当新节点选择父节点时,我们考虑了带宽可用性和往返时间(RTT)。最后,设计了一种有效的机制来分散在树木修复阶段同时重新加入的人群。仿真结果表明,与常用的直接树协议HMTP相比,该协议的连接延迟可降低50%
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On overlay multicast tree construction and maintenance
Overlay multicast tree construction and maintenance is a major challenge in designing application layer multicast protocols. In this paper, we focus on improving the joining and maintenance procedures of an overlay multicast tree. Unlike the existing direct-tree protocols, our proposed overlay multicast tree protocol (OMTP) has the following characteristics. First, by leveraging on the IP hierarchical addressing locality, we can speed up the formation of overlay multicast tree and enhance the efficiency of the tree maintenance. Second, we take both bandwidth availability and round-trip-time (RTT) into consideration when a newcomer selects its parent node. Finally, an effective mechanism is designed to disperse the simultaneous rejoin crowds in the tree repair phase. Simulation results show that with our proposed protocol, the join latency can be reduced by as large as 50% as compared with a popular direct-tree protocol HMTP
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信