A self-organizing overlay network to exploit the locality of interests for effective resource discovery in P2P systems

Hiroaki Kobayashi, H. Takizawa, T. Inaba, Yasuaki Takizawa
{"title":"A self-organizing overlay network to exploit the locality of interests for effective resource discovery in P2P systems","authors":"Hiroaki Kobayashi, H. Takizawa, T. Inaba, Yasuaki Takizawa","doi":"10.1109/SAINT.2005.8","DOIUrl":null,"url":null,"abstract":"P2P (Peer to Peer) is becoming a key technology to realize virtualized computing fields using the pervasive deployment and high-speed connectivity of computers through the Internet. However, P2P systems tend to waste the network bandwidth for resource acquisition because of its decentralized resource management. This paper proposes an efficient self-organizing overlay network for P2P-based grid computing systems to effectively reduce the number of resource-acquiring queries over the physical network. The resource exploitation space for some specific interests is organized as an overlay network, which is configured by making local clusters reflecting current interests of individual peers and connecting them together based on their similarity. In addition, the overlay network can be dynamically reconfigured based on the change in the interests of individual peers across time so that more useful peers at that time can be reconnected closer to their client peers. Therefore, multicasting of resource requesting messages can be carried out only over peers with similar interests that are connected through the overlay network. Experimental results indicate that the self-organizing overlay network can remarkably decrease both messages for resource acquisition and hops a resource requesting query travels to reach the peer that satisfies the request.","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2005 Symposium on Applications and the Internet","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAINT.2005.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

P2P (Peer to Peer) is becoming a key technology to realize virtualized computing fields using the pervasive deployment and high-speed connectivity of computers through the Internet. However, P2P systems tend to waste the network bandwidth for resource acquisition because of its decentralized resource management. This paper proposes an efficient self-organizing overlay network for P2P-based grid computing systems to effectively reduce the number of resource-acquiring queries over the physical network. The resource exploitation space for some specific interests is organized as an overlay network, which is configured by making local clusters reflecting current interests of individual peers and connecting them together based on their similarity. In addition, the overlay network can be dynamically reconfigured based on the change in the interests of individual peers across time so that more useful peers at that time can be reconnected closer to their client peers. Therefore, multicasting of resource requesting messages can be carried out only over peers with similar interests that are connected through the overlay network. Experimental results indicate that the self-organizing overlay network can remarkably decrease both messages for resource acquisition and hops a resource requesting query travels to reach the peer that satisfies the request.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种利用兴趣局部性的自组织覆盖网络用于P2P系统中有效的资源发现
P2P (Peer to Peer,点对点)利用计算机通过Internet的普及部署和高速连接,正在成为实现虚拟化计算领域的关键技术。然而,P2P系统由于其分散的资源管理,往往会浪费网络带宽用于资源获取。为有效减少物理网络上的资源获取查询,提出了一种基于p2p网格计算系统的高效自组织覆盖网络。将某些特定兴趣的资源开发空间组织成一个覆盖网络,该网络通过构造反映单个对等体当前兴趣的局部聚类,并根据它们的相似性将它们连接在一起来配置。此外,覆盖网络可以根据单个对等体的兴趣随时间的变化动态地重新配置,以便当时更有用的对等体可以重新连接到更靠近其客户端对等体的地方。因此,资源请求消息的多播只能在通过覆盖网络连接的具有相似兴趣的对等点上进行。实验结果表明,自组织覆盖网络可以显著减少资源获取消息和资源请求到达满足请求的节点的跳数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
HAR: hierarchy-based anycast routing protocol for wireless sensor networks Scalable overlay network deployment for dynamic collaborative groups Spam filtering using spam mail communities General virtual hosting via lightweight user-level visualization On coordinating personalized Web services using CooPS
×
引用
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