一种改进的非结构化P2P网络洪泛搜索机制

An Improved Flooding Based Search Mechanism in Unstructured P2P Network

非结构化P2P网络使用基于洪泛的查询算法来进行资源搜索。然而,这种搜索机制随着网络节点的增多,网络规模的增大,将产生大量的冗余查询消息,会导致网络流量急剧增加,引起网络拥塞。提出了一种基于转发区间的洪泛搜索机制FIFSM(forwarding interval based flooding search mechanism),通过为消息分配不相交的转发区间,使其沿着一棵生成树的结构传播,消除了消息环路,从而避免冗余消息的产生。FIFSM机制采用高效的网络维护策略,能够在动态环境下以较低的开销保证网络的稳定性。实验结果表明,FIFSM机制能够降低洪泛开销,保证资源搜索的高成功率和低延迟,是一种有效的非结构化P2P网络资源搜索机制。

In the unstructured P2 P networks,the flooding-based search algorithm is used to search resources; however,with increasing nodes and network scale,flooding-based search will produce large amount of redundant query messages,which will lead to heavy traffic and congestion of the network. We propose a Forwarding Interval based Flooding Search Mechanism（FIFSM）. By assigning a disjoint forwarding interval to each message,they spread along a spanning tree to avoid message loops,thus eliminating redundant messages. The efficient network maintenance strategy is presented in FIFSM; this ensures the stability of the network in dynamic environment at a very low cost. Experimental results and their analysis show preliminarily that FIFSM,as an efficient search mechanism in unstructured P2 P network,can reduce flooding overhead and achieve high success rate of resource search and low latency.