D-Flooding：非结构化P2P网络中高效搜索策略

为了能够在保持高覆盖范围的前提下大大减少冗余消息的数量,提出了一种新的基于连接度的搜索机制D-Flooding。D-Flooding在搜索的不同阶段,依据连接度大小来选择消息的转发对象。分析和实验结果表明,D-Flooding能够提供较低负载的查询,高效地应用于P2P搜索。与标准洪泛机制相比,在跳数不变的情况下,冗余消息的数量可减少84.5%以上,而消息的覆盖范围基本不变。

D-Flooding: efficient search algorithm in unstructured P2P networks

This paper proposed D-Flooding,an efficient degree-based flooding scheme,with the objective of minimizing the number of redundant messages and retaining the same message propagating scope as that of standard flooding.At the different searching steps,D-Flooding chose nodes to forward massages according to their degrees.Analysis and simulation results show that the D-Flooding scheme provides a low overhead broadcasting facility that can be effectively used in P2P searching.Compared with standard flooding used in Gnutella,it shows that the D-Flooding scheme with the same TTL can reduce up to more than 84.5% of flooding messages,and retain almost the same flooding scope.