• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Generalized Probabilistic Flooding in Unstructured Peer-to-Peer Networks
【24h】

Generalized Probabilistic Flooding in Unstructured Peer-to-Peer Networks

机译：非结构化对等网络中的广义概率泛洪

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, we propose a generalization of the basic flooding search strategy for decentralized unstructured peer-to-peer (P2P) networks. In our algorithm a peer forwards a query to one of its neighbors using a probability that is a function of the number of connections in the overlay network of both. Moreover, this probability may also depend on the distance from the query originator. To analyze the performance of the proposed search strategy in heterogeneous decentralized unstructured P2P networks, we develop a generalized random graph (GRG)-based model that takes into account the high variability in the number of application level connections that each peer establishes, and the nonuniform distribution of resources among peers. Furthermore, the model includes an analysis of peer availability, i.e., the capability of relaying queries of other peers, as a function of the query generation rate of each peer. Validation of the proposed model is carried out comparing the model predictions with simulations conducted on real overlay topologies obtained from crawling the popular file sharing application Gnutella.
机译：在本文中，我们提出了用于分散式非结构化对等（P2P）网络的基本洪泛搜索策略的概括。在我们的算法中，对等方使用与两者的覆盖网络中的连接数成函数的概率将查询转发至其邻居之一。此外，该概率还可能取决于距查询发起者的距离。为了分析所提出的搜索策略在异构分散的非结构化P2P网络中的性能，我们开发了一种基于广义随机图（GRG）的模型，该模型考虑了每个对等方建立的应用程序级别连接数量的高可变性以及不均匀性在同伴之间分配资源。此外，该模型包括对等体可用性的分析，即，根据每个对等体的查询生成率来中继其他对等体的查询的能力。通过将模型预测与对通过爬取流行的文件共享应用程序Gnutella获得的真实覆盖拓扑进行的仿真进行比较，对所提出的模型进行了验证。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号