• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Enhancing Search Performance in Unstructured P2P Networks Based on Users'' Common Interest
【24h】

Enhancing Search Performance in Unstructured P2P Networks Based on Users'' Common Interest

机译：基于用户共同兴趣提高非结构化P2P网络中的搜索性能

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

摘要

Peer-to-Peer (P2P) networks establish loosely-coupled application-level overlays on top of the Internet to facilitate efficient sharing of resources. They can be roughly classified as either structured or unstructured networks. Without stringent constraints over the network topology, unstructured P2P networks can be constructed very efficiently and are therefore considered suitable to the Internet environment. However, the random search strategies adopted by these networks usually perform poorly with large network size. In this paper, we seek to enhance the search performance in unstructured P2P networks through exploiting users'' common interest patterns captured within a probability-theoretic framework termed the user interest model (UIM). A search protocol and a routing table updating protocol are further proposed in order to expedite the search process through self-organizing the P2P network into a small world. Both theoretical and experimental analysis are conducted and demonstrated the effectiveness and efficiency of our approach.
机译：对等（P2P）网络在Internet顶部建立松耦合的应用程序级覆盖，以促进资源的有效共享。它们可以大致分为结构化或非结构化网络。在没有严格的网络拓扑约束的情况下，非结构化的P2P网络可以非常有效地构建，因此被认为适合Internet环境。但是，这些网络采用的随机搜索策略通常在网络规模较大时效果较差。在本文中，我们试图通过利用在称为用户兴趣模型（UIM）的概率理论框架内捕获的用户的共同兴趣模式来增强非结构化P2P网络中的搜索性能。进一步提出了搜索协议和路由表更新协议，以通过将P2P网络自组织成一个小世界来加快搜索过程。进行了理论和实验分析，并证明了我们方法的有效性和效率。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号