Performance of search strategies in two-tier peer-to-peer networks

R. Gaeta, M. Sereno
{"title":"Performance of search strategies in two-tier peer-to-peer networks","authors":"R. Gaeta, M. Sereno","doi":"10.1109/ITNEWS.2008.4488124","DOIUrl":null,"url":null,"abstract":"In this paper we analyze the performance of generalized flooding search strategies in two-tier peer-to-peer networks by means of random graphs. In particular, the connections between top and bottom-level peers are modeled as a bipartite random graph while the overlay network used by top-level peers to forward queries is modeled as a generalized random graph. To assign realistic values to the input model parameters we developed a distributed crawler of the Gnutella network to obtain snapshots of the application topology at both levels; to validate the model predictions we conducted simulation experiments on these snapshots. We exploited the model to show how generalizations of the classical flooding technique can help to design search strategies that meet pre-defined requirements on the hit probability and the average number of query messages exchanged during a search operation.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITNEWS.2008.4488124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper we analyze the performance of generalized flooding search strategies in two-tier peer-to-peer networks by means of random graphs. In particular, the connections between top and bottom-level peers are modeled as a bipartite random graph while the overlay network used by top-level peers to forward queries is modeled as a generalized random graph. To assign realistic values to the input model parameters we developed a distributed crawler of the Gnutella network to obtain snapshots of the application topology at both levels; to validate the model predictions we conducted simulation experiments on these snapshots. We exploited the model to show how generalizations of the classical flooding technique can help to design search strategies that meet pre-defined requirements on the hit probability and the average number of query messages exchanged during a search operation.
两层对等网络中搜索策略的性能
本文利用随机图分析了两层对等网络中广义泛洪搜索策略的性能。其中,顶层节点和底层节点之间的连接被建模为二部随机图,顶层节点转发查询使用的覆盖网络被建模为广义随机图。为了给输入模型参数赋实际值,我们开发了Gnutella网络的分布式爬虫,以获得两个级别的应用程序拓扑的快照;为了验证模型的预测,我们对这些快照进行了模拟实验。我们利用该模型来展示经典泛洪技术的泛化如何帮助设计搜索策略,以满足在搜索操作期间对命中概率和平均查询消息交换数量的预定义要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信