作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (22): 134-136,. doi: 10.3969/j.issn.1000-3428.2007.22.046

• 网络与通信 • 上一篇    下一篇

基于代理节点的无结构对等网查询机制

赵 奇,刘皎瑶,徐敬东   

  1. (南开大学计算机科学与技术系,天津 300071)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-11-20 发布日期:2007-11-20

Search Mechanism in Unstructured P2P Networks Based on Proxy Peer

ZHAO Qi, LIU Jiao-yao, XU Jing-dong   

  1. (Department of Computer Science and Technology, Nankai University, Tianjin 300071)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-11-20 Published:2007-11-20

摘要: 在基于洪泛的无结构对等网中,尽管被查询文件的流行度不同,查询消息仍以同样的方式处理,从而产生大量不必要的消息。为了提高查询效率,该文提出一种基于代理节点的查询机制。一个查询消息被源节点转发给多个代理节点,它们连同源节点发起多个小洪泛。源节点通过调整小洪泛的数量控制查询过程。与Gnutella中的洪泛查询相比,新的查询机制在保持相似成功率的同时最多减少56%的带宽消耗,在保持相同命中数目的同时将响应时间缩短15%。

关键词: 对等网络, 查询机制, 代理节点, 小洪泛

Abstract: Flooding-based unstructured P2P systems handle all queries identically no matter how popular the querying objects are, hence it result in a great amount of unnecessary messages. Aiming at improving search efficiency, this paper proposes a search mechanism with multiple small-scale floods initiated by proxy peers for a query. Querying sources control query processes by adopting different numbers of floods. Compared with standard flooding used in Gnutella, the new search mechanism can reduce the average query traffic cost by up to 56% while achieving comparable success rate. The mechanism can shorten response time by up to 15% while achieving the same query hits.

Key words: peer-to-peer networks, search mechanism, proxy peer, small-scale flood

中图分类号: