Scoped broadcast in dynamic peer-to-peer networks

Hung-Chang Hsiao, C. King
{"title":"Scoped broadcast in dynamic peer-to-peer networks","authors":"Hung-Chang Hsiao, C. King","doi":"10.1109/COMPSAC.2005.134","DOIUrl":null,"url":null,"abstract":"Scoped broadcast disseminates a message to all the nodes within a designated physical/logical region in an overlay network. It can be a basic building block for applications such as information search, data broadcasting, and overlay structure diagnostic. In this paper, we study scoped broadcast in peer-to-peer (P2P) overlay networks based on distributed hash tables (DHT). Since P2P networks have very dynamic behavior due to peer joining and departure, it is interesting to know how many peers can be reached with one scoped broadcast. This depends mainly on the cost we would like to pay for maintaining the geometric structure of the DHT-based overlay. The maintenance cost is affected primarily by the failure detection and failure recovery mechanisms. We evaluated the effects of maintenance overhead on scoped broadcast via extensive simulations. The evaluation shows that it is important to exploit fresh nodes as the neighbors of a node. In addition, cooperative failure discovery and recovery can efficiently and effectively disseminate scoped broadcast messages.","PeriodicalId":419267,"journal":{"name":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"29th Annual International Computer Software and Applications Conference (COMPSAC'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPSAC.2005.134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Scoped broadcast disseminates a message to all the nodes within a designated physical/logical region in an overlay network. It can be a basic building block for applications such as information search, data broadcasting, and overlay structure diagnostic. In this paper, we study scoped broadcast in peer-to-peer (P2P) overlay networks based on distributed hash tables (DHT). Since P2P networks have very dynamic behavior due to peer joining and departure, it is interesting to know how many peers can be reached with one scoped broadcast. This depends mainly on the cost we would like to pay for maintaining the geometric structure of the DHT-based overlay. The maintenance cost is affected primarily by the failure detection and failure recovery mechanisms. We evaluated the effects of maintenance overhead on scoped broadcast via extensive simulations. The evaluation shows that it is important to exploit fresh nodes as the neighbors of a node. In addition, cooperative failure discovery and recovery can efficiently and effectively disseminate scoped broadcast messages.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
动态点对点网络中的范围广播
范围广播将消息传播到覆盖网络中指定物理/逻辑区域内的所有节点。它可以作为信息搜索、数据广播和覆盖结构诊断等应用程序的基本构建块。本文研究了基于分布式哈希表(DHT)的P2P覆盖网络中的范围广播。由于P2P网络由于节点的加入和离开而具有非常动态的行为,因此了解一次范围广播可以到达多少个节点是很有趣的。这主要取决于我们想要为维护基于dht的覆盖层的几何结构而支付的成本。维护成本主要受故障检测和故障恢复机制的影响。我们通过广泛的模拟评估了维护开销对范围广播的影响。结果表明,利用新节点作为节点的邻居是非常重要的。此外,协同故障发现和恢复可以高效有效地传播有范围的广播消息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A formal approach to designing a class-subclass structure using a partial-order on the functions Partition testing with dynamic partitioning Testing coverage analysis for software component validation Tridirectional computed chaining: an efficient hashing algorithm for limited space applications Considerations on a new software architecture for distributed environments using autonomous semantic agents
×
引用
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