基于查询轨迹中介拓扑重构的非结构化P2P网络性能权衡探索

K. Ohnishi, S. Nagamatsu, Y. Oie
{"title":"基于查询轨迹中介拓扑重构的非结构化P2P网络性能权衡探索","authors":"K. Ohnishi, S. Nagamatsu, Y. Oie","doi":"10.1109/HIS.2007.22","DOIUrl":null,"url":null,"abstract":"This paper presents a topology reconstruction method to explore better trade-off points between search and access load balancing performance in unstructured peer-to-peer (P2P) file sharing networks. The proposed topology reconstruction method changes a network topology in a dynamic, autonomous, and decentralized manner. The topology reconstruction is based on local threshold-based rules that use query trails, which stand for information on previous successful search paths. A power-law network is used as the initial network in simulations. The simulation results show that, depending on the setting of the threshold values, compared to the case without topology reconstruction, the proposed method can explore better trade-off points between search and storage access load balancing performance.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Performance Trade-off Exploration by Query-Trail-Mediated Topology Reconstruction in Unstructured P2P Networks\",\"authors\":\"K. Ohnishi, S. Nagamatsu, Y. Oie\",\"doi\":\"10.1109/HIS.2007.22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a topology reconstruction method to explore better trade-off points between search and access load balancing performance in unstructured peer-to-peer (P2P) file sharing networks. The proposed topology reconstruction method changes a network topology in a dynamic, autonomous, and decentralized manner. The topology reconstruction is based on local threshold-based rules that use query trails, which stand for information on previous successful search paths. A power-law network is used as the initial network in simulations. The simulation results show that, depending on the setting of the threshold values, compared to the case without topology reconstruction, the proposed method can explore better trade-off points between search and storage access load balancing performance.\",\"PeriodicalId\":359991,\"journal\":{\"name\":\"7th International Conference on Hybrid Intelligent Systems (HIS 2007)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"7th International Conference on Hybrid Intelligent Systems (HIS 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HIS.2007.22\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HIS.2007.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种拓扑重构方法,以探索非结构化P2P文件共享网络中搜索和访问负载均衡性能之间更好的平衡点。本文提出的拓扑重建方法以动态、自治和分散的方式改变网络拓扑。拓扑重建基于使用查询轨迹的本地阈值规则,查询轨迹代表以前成功搜索路径的信息。仿真中采用幂律网络作为初始网络。仿真结果表明,在阈值设置不同的情况下,与不进行拓扑重构的情况相比,所提方法能更好地探索搜索和存储访问负载均衡性能之间的平衡点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Performance Trade-off Exploration by Query-Trail-Mediated Topology Reconstruction in Unstructured P2P Networks
This paper presents a topology reconstruction method to explore better trade-off points between search and access load balancing performance in unstructured peer-to-peer (P2P) file sharing networks. The proposed topology reconstruction method changes a network topology in a dynamic, autonomous, and decentralized manner. The topology reconstruction is based on local threshold-based rules that use query trails, which stand for information on previous successful search paths. A power-law network is used as the initial network in simulations. The simulation results show that, depending on the setting of the threshold values, compared to the case without topology reconstruction, the proposed method can explore better trade-off points between search and storage access load balancing performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信