Thicket: A Protocol for Building and Maintaining Multiple Trees in a P2P Overlay

M. Ferreira, J. Leitao, L. Rodrigues
{"title":"Thicket: A Protocol for Building and Maintaining Multiple Trees in a P2P Overlay","authors":"M. Ferreira, J. Leitao, L. Rodrigues","doi":"10.1109/SRDS.2010.19","DOIUrl":null,"url":null,"abstract":"One way to efficiently disseminate information in a P2P overlay is to rely on a spanning tree. However, in a tree, interior nodes support a much higher load than leaf nodes. Also, the failure of a single node can break the tree, impairing the reliability of the dissemination protocol. These problems can be addressed by using multiple trees, such that each node is interior in just a few trees and a leaf node in the remaining, the multiple trees approach allows to achieve load distribution and also to send redundant information for fault-tolerance. This paper proposes Thicket, a decentralized algorithm to efficiently build and maintain such multiple trees over a single unstructured overlay network. The algorithm has been implemented and is extensively evaluated using simulation in a P2P overlay with 10.000 nodes.","PeriodicalId":219204,"journal":{"name":"2010 29th IEEE Symposium on Reliable Distributed Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 29th IEEE Symposium on Reliable Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SRDS.2010.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 30

Abstract

One way to efficiently disseminate information in a P2P overlay is to rely on a spanning tree. However, in a tree, interior nodes support a much higher load than leaf nodes. Also, the failure of a single node can break the tree, impairing the reliability of the dissemination protocol. These problems can be addressed by using multiple trees, such that each node is interior in just a few trees and a leaf node in the remaining, the multiple trees approach allows to achieve load distribution and also to send redundant information for fault-tolerance. This paper proposes Thicket, a decentralized algorithm to efficiently build and maintain such multiple trees over a single unstructured overlay network. The algorithm has been implemented and is extensively evaluated using simulation in a P2P overlay with 10.000 nodes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
灌木丛:在P2P覆盖层中构建和维护多棵树的协议
在P2P覆盖层中有效传播信息的一种方法是依赖生成树。然而,在树中,内部节点支持的负载比叶节点高得多。此外,单个节点的故障可能会破坏树,从而损害传播协议的可靠性。这些问题可以通过使用多树来解决,这样每个节点只在几棵树的内部,在其余的树中有一个叶节点,多树方法允许实现负载分配,也可以发送冗余信息以实现容错。本文提出了一种去中心化算法Thicket,用于在单个非结构化覆盖网络上高效地构建和维护这样的多棵树。该算法已经实现,并在10,000个节点的P2P覆盖中进行了广泛的仿真评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Optimization Based Topology Control for Wireless Ad Hoc Networks to Meet QoS Requirements An Entity-Centric Approach for Privacy and Identity Management in Cloud Computing On-Demand Recovery in Middleware Storage Systems Adaptive Routing Scheme for Emerging Wireless Ad Hoc Networks Diskless Checkpointing with Rollback-Dependency Trackability
×
引用
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