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

计算机工程 ›› 2010, Vol. 36 ›› Issue (3): 86-88. doi: 10.3969/j.issn.1000-3428.2010.03.028

• 软件技术与数据库 • 上一篇    下一篇

一种用于无结构P2P网络的搜索算法

徐敬东,高立金,刘皎瑶,李 潇,张建忠   

  1. (南开大学信息技术科学学院,天津 300071)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-02-05 发布日期:2010-02-05

Search Algorithm for Unstructured P2P Networks

XU Jing-dong, GAO Li-jin, LIU Jiao-yao, LI Xiao, ZHANG Jian-zhong   

  1. (College of Information Technical Science, Nankai University, Tianjin 300071)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-02-05 Published:2010-02-05

摘要: 无结构P2P文件共享系统进行文件搜索时,常常造成大量网络资源的浪费,文件的流行度呈现不均衡分布,搜索稀缺文件失败的可能性很大。针对这些问题,在Gnutella协议的基础上,引入预算机制,结合蚁群算法的正反馈策略,提出AntBudget搜索算法,以减轻上述缺陷带来的负面影响。

关键词: 无结构P2P网络, 搜索, 预算, 蚁群

Abstract: Searching files in traditional unstructured P2P networks often consumes a large amount of network resources. Queries for rare objects do not receive the desired number of results or even fail, because of the object-popularity’s imbalanced distribution. Aiming at these problems, this paper proposes a new search algorithm, AntBudget, which is based on Gnutella protocol and adopts the budget mechanism as well as the trail-laying-and-following policy of ant colony optimization principle. The negative impact is reduced.

Key words: unstructured P2P networks, search, budget, ant colony

中图分类号: