An Efficient HybridFlood Searching Algorithm for Unstructured Peer-to-Peer Networks

Searching in peer-to-peer is started by flooding technique. This technique produces huge redundant messages in each hop. These Redundant messages limit system scalability and cause unnecessary traffic in a network. To improve this searching technique and reduce redundant messages, this paper proposes a novel algorithm called HybridFlood. In HybridFlood algorithm, flooding scheme divided into two phases. At the first phase the algorithm follows flooding by limited number of hops. In the second phase, it chooses nosey nodes in each searching horizon. The nosey nodes are nodes, which have the most links to others. These nodes maintain the data index of all clients. The proposed algorithm extends the search efficiency by reducing redundant messages in each hop. Simulation results show that the proposed algorithm decreases 60% of redundant messages and saves up to 70% of searching traffic.