计算机工程 ›› 2006, Vol. 32 ›› Issue (19): 117-119.doi: 10.3969/j.issn.1000-3428.2006.19.042

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

自适应P2P网络搜索算法

吴 宇1,2,3,虞淑瑶1,2,3,宋 成1   

  1. (1. 中国科学院计算机网络信息中心,北京 100080;2. 中国科学院计算技术研究所,北京 100080;3. 中国科学院研究生院,北京 100080)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2006-10-05 发布日期:2006-10-05

An Adaptive Search Algorithm for P2P Network

WU Yu1,2,3, YU Shuyao1,2,3, SONG Cheng1   

  1. (1. Computer Network Information Center, Chinese Academy of Sciences, Beijing 100080; 2. Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080; 3. Graduate School, Chinese Academy of Sciences, Beijing 100080)
  • Received:1900-01-01 Revised:1900-01-01 Online:2006-10-05 Published:2006-10-05

摘要: 提出了一个基于查询代理的无结构P2P网络盲搜索算法,该算法在查询过程中感知并分析P2P网络的相关信息,根据查询满足情况自适应地控制子查询规模。与已有的盲搜索算法相比,查询代理算法实现了更细致的冗余开销控制,并避免了已有算法存在的优化难题。与已有盲搜索算法的对比实验的结果证实该算法可以更有效地降低冗余开销。

关键词: 无结构P2P网络, 查询代理, 盲搜索算法, 冗余开销

Abstract: This paper proposes a query-agent based blind searching algorithm for unstructured P2P network, which collects and analyzes the information of the P2P network in querying process, and adaptively adjusts the sub-query scale according to the query situation. Compared with the present algorithms, the query-agent algorithm provides more delicate control ability for redundant cost, and avoids the optimizing dilemma of the present algorithms. This paper runs the contrastive experiment, and the simulation result proves that the query-agent algorithm can reduce the redundant cost more effectively.

Key words: Unstructured P2P network, Query agent, Blind search algorithm, Redundant cost

中图分类号: