• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >An Effective P2P Search Scheme to Exploit File Sharing Heterogeneity
【24h】

An Effective P2P Search Scheme to Exploit File Sharing Heterogeneity

机译：利用文件共享异质性的有效P2P搜索方案

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

摘要

Although the original intent of the peer-to-peer (P2P) concept is to treat each participant equally, heterogeneity widely exists in deployed P2P networks. Peers are different from each other in many aspects, such as bandwidth, CPU power, and storage capacity. Some approaches have been proposed to take advantage of the query forwarding heterogeneity such that the high bandwidth of powerful nodes can be fully utilized to maximize the system capacity. In this paper, we suggest using the query answering heterogeneity to directly improve the search efficiency of P2P networks. In our proposed differentiated search (DiffSearch) algorithm, the peers with high query answering capabilities will have higher priority to be queried. Because the query answering capabilities are extremely unbalanced among peers, a high query success rate can be achieved by querying only a small portion of a network. The search traffic is significantly reduced due to the shrunken search space. Our trace analysis and simulation show that the DiffSearch algorithm can save up to 60 percent of search traffic
机译：尽管点对点（P2P）概念的最初意图是平等地对待每个参与者，但是异构性在已部署的P2P网络中广泛存在。对等体在许多方面都彼此不同，例如带宽，CPU能力和存储容量。已经提出了一些利用查询转发异构性的方法，从而可以充分利用强大节点的高带宽来最大化系统容量。在本文中，我们建议使用查询应答异构性来直接提高P2P网络的搜索效率。在我们提出的差异搜索（DiffSearch）算法中，具有较高查询回答能力的对等节点将具有更高的优先级进行查询。因为查询应答能力在同级之间极为不平衡，所以仅查询网络的一小部分就可以实现很高的查询成功率。由于缩小了搜索空间，大大减少了搜索流量。我们的跟踪分析和模拟表明，DiffSearch算法可以节省多达60％的搜索流量

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号