无标度拓扑对Ad Hoc网络中八卦的影响

B. Garbinato, Denis Rochat, M. Tomassini
{"title":"无标度拓扑对Ad Hoc网络中八卦的影响","authors":"B. Garbinato, Denis Rochat, M. Tomassini","doi":"10.1109/NCA.2007.29","DOIUrl":null,"url":null,"abstract":"We show that scale-free topologies have a positive impact on the performance of gossiping algorithms in peer-to-peer overlay networks. This result is important in the context of ad hoc networks, where each node participates in controlling the network topology. Our study shows that, when combined with such topologies, typical gossiping algorithms tend to require fewer messages and experience smaller latency than when combined with other topologies, such as rings or grids. This suggests that the topology control scheme should aim at producing an overlay network that exhibits scale-free characteristics.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Impact of Scale-free Topologies on Gossiping in Ad Hoc Networks\",\"authors\":\"B. Garbinato, Denis Rochat, M. Tomassini\",\"doi\":\"10.1109/NCA.2007.29\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that scale-free topologies have a positive impact on the performance of gossiping algorithms in peer-to-peer overlay networks. This result is important in the context of ad hoc networks, where each node participates in controlling the network topology. Our study shows that, when combined with such topologies, typical gossiping algorithms tend to require fewer messages and experience smaller latency than when combined with other topologies, such as rings or grids. This suggests that the topology control scheme should aim at producing an overlay network that exhibits scale-free characteristics.\",\"PeriodicalId\":135395,\"journal\":{\"name\":\"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCA.2007.29\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA.2007.29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22

摘要

我们证明了无标度拓扑对点对点覆盖网络中的八卦算法的性能有积极的影响。这个结果在ad hoc网络的上下文中很重要,在ad hoc网络中,每个节点都参与控制网络拓扑。我们的研究表明,当与这些拓扑结合使用时,典型的八卦算法往往需要更少的消息,并且比与其他拓扑(如环或网格)结合使用时经历更小的延迟。这表明拓扑控制方案应以产生具有无标度特征的覆盖网络为目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Impact of Scale-free Topologies on Gossiping in Ad Hoc Networks
We show that scale-free topologies have a positive impact on the performance of gossiping algorithms in peer-to-peer overlay networks. This result is important in the context of ad hoc networks, where each node participates in controlling the network topology. Our study shows that, when combined with such topologies, typical gossiping algorithms tend to require fewer messages and experience smaller latency than when combined with other topologies, such as rings or grids. This suggests that the topology control scheme should aim at producing an overlay network that exhibits scale-free characteristics.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Constructing Overlay Networks with Low Link Costs and Short Paths Approximate Analytical Models for Networked Servers Subject to MMPP Arrival Processes A Global On-Demand Routing Protocol for Mobile Ad Hoc Networks On the Evaluation of Shortest Journeys in Dynamic Networks Multilayer In-service Reconfiguration for Network Computing Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1