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.