基于节点兴趣非结构化P2P网络搜索机制研究

Research on Search Mechanism of Unstructured P2P Network Based on Node of Interest

随着网络用户以及网络资源的增长,P2P网络,一种在对等者(peer)之间分配任务和工作负载的分布式应用架构,引起了广泛关注。由于具有较好的可用性、可扩展性,非结构化P2P网络成为P2P网络研究的热点。现今对于非结构化P2P网络资源搜索算法的研究主要是在洪泛算法的基础上进行一定的改进,但这些算法存在明显的问题:一是算法在搜索过程中有一定的盲目性,搜索效率不高;二是搜索过程中会向所有邻居节点发送消息从而产生大量的冗余消息,易造成网络阻塞。针对上述问题,提出一种基于节点兴趣的非结构化P2P覆盖网络拓扑结构,在相似度较高的节点之间建立二叉搜索树来降低查询消息转发的盲目性并提高搜索效率。仿真结果表明,与传统的洪泛算法相比,提出的非结构化P2P网络搜索机制查询时间更短,查询消息量更少,搜索效率更高。

Peer-to-Peer （P2P） network, a distributed application architecture that divides tasks and workloads between peers, has recently attracted lots of concern since the growth of network users and network resources. Unstructured P2P networks have better usability and scalability,whieh makes it become the focus of P2P network research. Unstructured P2P network resource search algorithm is mainly based on improved flooding algorithm, but these algorithms exist some obvious problems. One is the central idea of the blind search algo- rithm, the search efficiency is not high;the two is the search process will produce a message sent to a large number of redundant messages from neighbor nodes, easy to cause network congestion. For these issues, we raise a binary searching tree based on interest unstructured P2P overlay network topology. A logical connection between similar nodes is used to reduce the blindness of message forwarding and to improve the search efficiency. The simulation shows that compared with the traditional flooding algorithm,the proposed unstructured P2P network search mechanism has shorter query time, less query message and higher search efficiency.