授权和弦DHT覆盖

S. Ktari, Artur Hecker, H. Labiod
{"title":"授权和弦DHT覆盖","authors":"S. Ktari, Artur Hecker, H. Labiod","doi":"10.1109/HPSR.2009.5307418","DOIUrl":null,"url":null,"abstract":"In peer to peer networks, the overlay topology connecting peers is an important component in addition to peer and data organization and search. In fact, topological characteristics have an important impact on the efficiency of search on such networks. In this paper, we address this issue for Chord based P2P systems. Based on the Barabasi Albert (BA) model, we propose to extend the topology of Chord to a scale free graph DHT, named PL-Chord, to provide a non hierarchical super-peer based lookup algorithm with an efficient search support. Through several simulation experiments, we found that PL-DHT could construct an overlay network that extends the search region and provides higher reachability at a very little additional cost.","PeriodicalId":251545,"journal":{"name":"2009 International Conference on High Performance Switching and Routing","volume":"159 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Empowering Chord DHT overlays\",\"authors\":\"S. Ktari, Artur Hecker, H. Labiod\",\"doi\":\"10.1109/HPSR.2009.5307418\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In peer to peer networks, the overlay topology connecting peers is an important component in addition to peer and data organization and search. In fact, topological characteristics have an important impact on the efficiency of search on such networks. In this paper, we address this issue for Chord based P2P systems. Based on the Barabasi Albert (BA) model, we propose to extend the topology of Chord to a scale free graph DHT, named PL-Chord, to provide a non hierarchical super-peer based lookup algorithm with an efficient search support. Through several simulation experiments, we found that PL-DHT could construct an overlay network that extends the search region and provides higher reachability at a very little additional cost.\",\"PeriodicalId\":251545,\"journal\":{\"name\":\"2009 International Conference on High Performance Switching and Routing\",\"volume\":\"159 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on High Performance Switching and Routing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR.2009.5307418\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on High Performance Switching and Routing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2009.5307418","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在对等网络中,连接对等体的覆盖拓扑结构是对等体和数据组织与搜索的重要组成部分。事实上,拓扑特征对这类网络的搜索效率有着重要的影响。在本文中,我们针对基于Chord的P2P系统解决了这个问题。在Barabasi Albert (BA)模型的基础上,提出将Chord的拓扑结构扩展为一个无标度图DHT,命名为PL-Chord,以提供一种具有高效搜索支持的非分层超级对等查找算法。通过多次仿真实验,我们发现PL-DHT可以构建一个覆盖网络,以很小的额外成本扩展搜索区域并提供更高的可达性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Empowering Chord DHT overlays
In peer to peer networks, the overlay topology connecting peers is an important component in addition to peer and data organization and search. In fact, topological characteristics have an important impact on the efficiency of search on such networks. In this paper, we address this issue for Chord based P2P systems. Based on the Barabasi Albert (BA) model, we propose to extend the topology of Chord to a scale free graph DHT, named PL-Chord, to provide a non hierarchical super-peer based lookup algorithm with an efficient search support. Through several simulation experiments, we found that PL-DHT could construct an overlay network that extends the search region and provides higher reachability at a very little additional cost.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信