【24h】

Search in Unstructured Peer-to-Peer Networks

机译:在非结构化对等网络中搜索

获取原文
获取原文并翻译 | 示例

摘要

Unstructured Peer-to-Peer (hence P2P) applications, such as KaZaa, Gnutella, etc. are very popular on the Internet over the last few years. Search method is a major component of these distributed systems and its efficiency also does influence the systems performance. An efficient technique for improving performance of search method is to replicate file location information in P2P networks. Unstructured P2P topology has power-law characteristic in the link distribution, so we present a replica spread mechanism utilizing high degree nodes in this paper. Based on this spread mechanism, we proposed two search methods. Extensive simulation results show that they performs very well on the power-law networks, achieve high success rates, and are robust to node failure.
机译:在过去的几年中,非结构化对等(因此称为P2P)应用程序,例如KaZaa,Gnutella等,在Internet上非常流行。搜索方法是这些分布式系统的主要组成部分,其效率也确实会影响系统性能。一种提高搜索方法性能的有效技术是在P2P网络中复制文件位置信息。非结构化的P2P拓扑在链路分布中具有幂律特性,因此本文提出了一种利用高度节点的副本传播机制。基于这种传播机制,我们提出了两种搜索方法。大量的仿真结果表明,它们在幂律网络上的性能非常好,成功率很高,并且对节点故障具有鲁棒性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号