Scalable and reliable multicast ACK tree construction with the token repository service

C. Maihofer
{"title":"Scalable and reliable multicast ACK tree construction with the token repository service","authors":"C. Maihofer","doi":"10.1109/ICON.2000.875813","DOIUrl":null,"url":null,"abstract":"Reliable multicast is realized in a scalable way by tree based approaches, where the receivers are organized in an ACK tree. Usually, expanding ring search (ERS) is used to create such ACK trees. However ERS has some shortcomings like poor scalability, strong dependency on the multicast routing protocol and the need for bidirectional multicast capable network, which makes it difficult to use ERS as the Internet standard mechanism. In this paper we propose the token repository service (TRS), which is based on a token repository and a modification of ERS. The TRS stores tokens, which represents the right for a joining node to connect to a certain parent node in the ACK tree. Performance evaluations show that the TRS approach has several advantageous compared to ERS, like improved scalability and independence of the routing protocol.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2000.875813","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Reliable multicast is realized in a scalable way by tree based approaches, where the receivers are organized in an ACK tree. Usually, expanding ring search (ERS) is used to create such ACK trees. However ERS has some shortcomings like poor scalability, strong dependency on the multicast routing protocol and the need for bidirectional multicast capable network, which makes it difficult to use ERS as the Internet standard mechanism. In this paper we propose the token repository service (TRS), which is based on a token repository and a modification of ERS. The TRS stores tokens, which represents the right for a joining node to connect to a certain parent node in the ACK tree. Performance evaluations show that the TRS approach has several advantageous compared to ERS, like improved scalability and independence of the routing protocol.
具有令牌存储库服务的可扩展和可靠的多播ACK树构建
可靠的多播是通过基于树的方法以可扩展的方式实现的,其中接收器被组织在ACK树中。通常使用扩展环搜索(ERS)来创建这样的ACK树。然而,ERS存在可扩展性差、对组播路由协议依赖性强、需要双向组播网络等缺点,使得其难以作为Internet标准机制。本文提出了基于令牌存储库和ERS的修改的令牌存储库服务(TRS)。TRS存储令牌,它表示连接节点连接到ACK树中某个父节点的权利。性能评估表明,与ERS相比,TRS方法有几个优势,比如改进的可伸缩性和路由协议的独立性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信