应用层组播方案中的跳数

M. Janic, Novi Ineke, Cempaka Wangi, Xiaoming Zhou, P. Mieghem
{"title":"应用层组播方案中的跳数","authors":"M. Janic, Novi Ineke, Cempaka Wangi, Xiaoming Zhou, P. Mieghem","doi":"10.1109/NCA.2005.25","DOIUrl":null,"url":null,"abstract":"Application layer (AL) multicast emerged as a response to a slow deployment of IP multicast. However, the gain of AL multicast over unicast is questionable. We investigate the efficiency of the two prominent protocols, MCAN and Scribe, in terms of the number of hops. We compare the efficiency of these algorithms to the efficiency of unicast and IP multicast via extensive simulations, as well as via measurements on the PlanetLab network. We introduce modifications to the MCAN algorithm that lead to a reduction in the hopcount. Finally, we demonstrate that the topology unawareness under certain conditions can make these schemes less efficient than unicast","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"196 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Hopcount in Application Layer Multicast Schemes\",\"authors\":\"M. Janic, Novi Ineke, Cempaka Wangi, Xiaoming Zhou, P. Mieghem\",\"doi\":\"10.1109/NCA.2005.25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Application layer (AL) multicast emerged as a response to a slow deployment of IP multicast. However, the gain of AL multicast over unicast is questionable. We investigate the efficiency of the two prominent protocols, MCAN and Scribe, in terms of the number of hops. We compare the efficiency of these algorithms to the efficiency of unicast and IP multicast via extensive simulations, as well as via measurements on the PlanetLab network. We introduce modifications to the MCAN algorithm that lead to a reduction in the hopcount. Finally, we demonstrate that the topology unawareness under certain conditions can make these schemes less efficient than unicast\",\"PeriodicalId\":188815,\"journal\":{\"name\":\"Fourth IEEE International Symposium on Network Computing and Applications\",\"volume\":\"196 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fourth IEEE International Symposium on Network Computing and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCA.2005.25\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fourth IEEE International Symposium on Network Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA.2005.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

应用层(AL)组播是对IP组播缓慢部署的一种响应。然而,人工智能组播相对于单播的增益是值得怀疑的。我们在跳数方面研究了两个著名协议MCAN和Scribe的效率。我们通过广泛的模拟以及PlanetLab网络上的测量,将这些算法的效率与单播和IP多播的效率进行了比较。我们对MCAN算法进行了修改,从而减少了hopcount。最后,我们证明了在某些条件下拓扑不感知会使这些方案的效率低于单播方案
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hopcount in Application Layer Multicast Schemes
Application layer (AL) multicast emerged as a response to a slow deployment of IP multicast. However, the gain of AL multicast over unicast is questionable. We investigate the efficiency of the two prominent protocols, MCAN and Scribe, in terms of the number of hops. We compare the efficiency of these algorithms to the efficiency of unicast and IP multicast via extensive simulations, as well as via measurements on the PlanetLab network. We introduce modifications to the MCAN algorithm that lead to a reduction in the hopcount. Finally, we demonstrate that the topology unawareness under certain conditions can make these schemes less efficient than unicast
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信