一种基于蚁群算法的非结构化P2P网络搜索算法

A Search Algorithm for Unstructured Peer-to-Peer Networks Based on Ant Colony Optimization

在类似Gnutella的分散的非结构化P2P网络中,如何降低消息开销,提高搜索效率,是解决其扩展性问题的关键。引入蚁群算法的思想,提出一个非结构化P2P网络搜索算法。此算法利用蚂蚁留下信息素的正反馈机制,有效地指导搜索的方向,将查询消息包尽量发往目标可能存在的区域,从而减少冗余消息包的产生,得到更好的搜索输出。

For the scalability problem of the Gnutella- like decentralized and unstructured peer- to- peer networks, how to reduce their message packets and improve searching efficiency is very important. Based on Ant Colony Optimization principle, this paper proposes a new search algorithm for unstructured peer - to - peer networks by using the fact that the pheromone trail - laying - and - following behavior observed from natural ants applied to query routing in peer- to- peer networks and the peers will send the query messages to the areas where there could be the requested objects using the pheromone. The algorithm can reduce the produced message packets in the network, and gain the better searching results.