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

Search Algorithm for Unstructured P2P Networks

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

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.