A dynamic index allocation scheme for peer-to-peer networks

T. Ohta, Yasuo Masuda, Kouichi Mitsukawa, Y. Kakuda, Atsushi Ito
{"title":"A dynamic index allocation scheme for peer-to-peer networks","authors":"T. Ohta, Yasuo Masuda, Kouichi Mitsukawa, Y. Kakuda, Atsushi Ito","doi":"10.1109/ISADS.2005.1452164","DOIUrl":null,"url":null,"abstract":"File-sharing Peer-to-Peer systems are effective for autonomous information retrieval over the networks. However, the previous information retrieval schemes such as Gnutella and Local Indices have bad performance and large overhead. In order to solve these drawbacks, this paper proposes a dynamic information retrieval scheme, in which indices are dynamically allocated in appropriate nodes adaptively to variation of traffic patterns caused by query messages. The simulation experimental results show that the proposed scheme has good performance with reasonable overhead even when the traffic patterns vary as time proceeds.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISADS.2005.1452164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

File-sharing Peer-to-Peer systems are effective for autonomous information retrieval over the networks. However, the previous information retrieval schemes such as Gnutella and Local Indices have bad performance and large overhead. In order to solve these drawbacks, this paper proposes a dynamic information retrieval scheme, in which indices are dynamically allocated in appropriate nodes adaptively to variation of traffic patterns caused by query messages. The simulation experimental results show that the proposed scheme has good performance with reasonable overhead even when the traffic patterns vary as time proceeds.
对等网络的动态索引分配方案
文件共享点对点系统是实现网络信息自主检索的有效方法。然而,以往的Gnutella和Local index等信息检索方案存在性能差、开销大的问题。为了解决这些问题,本文提出了一种动态信息检索方案,该方案根据查询消息引起的流量模式变化,在适当的节点上动态分配索引。仿真实验结果表明,该方案在流量模式随时间变化的情况下具有良好的性能和合理的开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信