基于特别兴趣组的P2P网络搜索算法

Searching algorithm based on special interest group in P2P networks

从实现搜索引擎的角度,分析了泛洪策略(flooding strategy),扩展环策略(expendingring),行走者(walker)和多个行走者(k-walker)搜索策略。沿着这些策略的思路,引用“小世界”思想,进一步提出了基于特别兴趣组的P2P网路搜索查询算法。该算法的特点就是改变被动的提供信息网络节点为主动提供服务的网络节点,或者说把网络节点作用从信息提供者改变为查询向导。网络节点不但提供查询所求的内容,同时利用与它有相同兴趣的特别兴趣组通讯簿为所收到的查询提供指南。因此可以加快P2P网的查询速度,同时减轻网络负荷。

From the perspective of implementation of a searching engine, flooding strategy, expending ring strategy, walker strategy and k-walker strategy were analyzed. According to the strategies, the idea of ＂small world＂ was adopted, and then a searching algorithm based on special interest group in Peer-to-Peer networks was proposed. The key idea of the algorithm was to change the role of network nodes from passive information providers to active servers for enquiries. In other words, the role of network nodes was changed from an information provider to an inquiry guider. Each node not only provided the required information for enquiries, but also led enquiries to nodes with same interests using the address book of special interest group. Therefore, the searching process could be speeded up, and the load of network could be reduced.