基于朋友相关性的P2P快速搜索算法

A Friend Relativity-Based P2P Fast Search Algorithm

如何高效地搜索资源是P2P网络中最为关键的问题。对等网络拓扑结构往往不是简单的结构化或非结构化,采用单一的搜索方式效率低下,因此,提出一种改进的搜索算法——基于朋友相关性的搜索算法(FriendSearch),将基于结构化的Chord搜索算法与非结构化的洪泛搜索算法有机结合起来,在网络节点间建立朋友关系。实际系统应用表明本算法较常规Chord算法高效,准确。

How to search the resources efficiently is the key problem in peer-to-peer networks. The P2P network topologies usually isn＇t simply structured or unstructured and the efficiency of one search way is lowly. This paper introduces an improved search approach. A friend relativity-based P2P fast .search algorithm（Friend-Search）, the structure-based Chord algorithm and unstructured-based flooding search algorithm are combined to work together, friend relationship is established between the network nodes. Practical application results demonstrated that the algorithm compares the traditions Chord more efficiently and accurately.