RSB-Topo: A Topology Adaptation Algorithm for Unstructured P2P Networks

Yilin Wang, Wenzhong Li, Jianzhong Chen, Sanglu Lu, Fang Wang, Daoxu Chen
{"title":"RSB-Topo: A Topology Adaptation Algorithm for Unstructured P2P Networks","authors":"Yilin Wang, Wenzhong Li, Jianzhong Chen, Sanglu Lu, Fang Wang, Daoxu Chen","doi":"10.1109/ICPPW.2007.73","DOIUrl":null,"url":null,"abstract":"Peer-to-Peer (P2P) technology has been widely applied in today's Internet. Unstructured P2P systems, where peers connect with each other to form dynamic, flexible and scalable networks, are commonly used for resource sharing. Resource location in unstructured P2P systems tends to use \"blind search\" strategies (i.e. flooding and random walk) for its simplicity and low maintenance cost. However, due to lack of location information, the performance of \"blind search\" is heavily relied on the network topology. Topology adaptation, by properly adjusting the topology of the P2P overlay network, is a promising approach to improve the search performance. In this paper, we use Relative Search Betweenness (RSB) to estimate nodes' search ability. A RSB-based topology adaptation algorithm (RSB-Topo) is proposed, where peers spontaneously adjust their connections to achieve better performance. Simulation results show that our algorithm could greatly increase search success rate and search coverage, and also decrease response delay to improve the search performance in unstructured P2P networks.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPPW.2007.73","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Peer-to-Peer (P2P) technology has been widely applied in today's Internet. Unstructured P2P systems, where peers connect with each other to form dynamic, flexible and scalable networks, are commonly used for resource sharing. Resource location in unstructured P2P systems tends to use "blind search" strategies (i.e. flooding and random walk) for its simplicity and low maintenance cost. However, due to lack of location information, the performance of "blind search" is heavily relied on the network topology. Topology adaptation, by properly adjusting the topology of the P2P overlay network, is a promising approach to improve the search performance. In this paper, we use Relative Search Betweenness (RSB) to estimate nodes' search ability. A RSB-based topology adaptation algorithm (RSB-Topo) is proposed, where peers spontaneously adjust their connections to achieve better performance. Simulation results show that our algorithm could greatly increase search success rate and search coverage, and also decrease response delay to improve the search performance in unstructured P2P networks.
RSB-Topo:一种非结构化P2P网络拓扑自适应算法
点对点(P2P)技术在当今的互联网中得到了广泛的应用。非结构化的P2P系统通常用于资源共享,其中节点之间相互连接以形成动态、灵活和可扩展的网络。在非结构化P2P系统中,资源定位往往采用“盲搜索”策略(即泛洪和随机游走),因为其简单且维护成本低。然而,由于缺乏位置信息,“盲搜索”的性能严重依赖于网络拓扑。拓扑自适应是一种很有前途的提高P2P覆盖网络搜索性能的方法,它通过适当调整P2P覆盖网络的拓扑结构来实现。在本文中,我们使用相对搜索间度(RSB)来估计节点的搜索能力。提出了一种基于rsb的拓扑自适应算法(RSB-Topo),该算法可使对等体自发地调整其连接以获得更好的性能。仿真结果表明,该算法可以大大提高搜索成功率和搜索覆盖率,降低响应延迟,提高非结构化P2P网络的搜索性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信