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

计算机工程 ›› 2011, Vol. 37 ›› Issue (7): 109-111. doi: 10.3969/j.issn.1000-3428.2011.07.036

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

?无结构P2P网络中的混合式搜索方法

王 双,禹继国   

  1. (曲阜师范大学计算机科学学院,山东 日照 276826)
  • 出版日期:2011-04-05 发布日期:2011-03-31
  • 作者简介:王 双(1986-),女,硕士研究生,主研方向:对等计算,网络与通信;禹继国,教授、博士
  • 基金资助:
    国家自然科学基金资助项目(60373012);山东省自然科学基金资助项目(ZR2009GM009, ZR2009AM013);山东省高校科技计划基金资助项目(J10LG09)

Hybrid Search Method in Unstructured P2P Networks

WANG Shuang, YU Ji-guo   

  1. (School of Computer Science, Qufu Normal University, Rizhao 276826, China)
  • Online:2011-04-05 Published:2011-03-31

摘要: 针对轻洪泛冗余查询消息数多、对稀有资源搜索延迟大的问题,提出一种结合无结构P2P搜索技术和双向Chord环的混合式搜索方法。该方法利用节点的异构性,在k-walker随机走的基础上,根据邻居节点的查询能力,对查询请求的转发方式进行改进,在双向Chord环中对无结构P2P未搜索到的资源进行结构化P2P搜索。仿真结果证明,与轻洪泛相比,混合式搜索方法的冗余查询消息数较少,对稀有资源的搜索延迟较小。

关键词: P2P网络, 混合式搜索, 种子节点, 双向Chord环, 超节点

Abstract: Aiming at the problems of redundant query messages and long search delay on rare resources in LightFlooding, this paper proposes a hybrid search method which combines unstructured P2P search with bidirectional Chord ring. Based on the k-walker random walk, it utilizes the node heterogeneity to modify the query request-forward manner by considering the ability of neighbor nodes. Resources that can not be found by unstructured P2P search are searched along bidirectional Chord ring. Simulation results show that the method has better performance on redundant query messages and search delay on rare resources compared to LightFlooding.

Key words: P2P networks, hybrid search, seed node, bidirectional Chord ring, super peer

中图分类号: