Search Algorithm Based on Peers Division in Unstructured P2P Network

Flooding is the base of unstructured P2P (Peer to Peer) systems, such as Gnutella. Pure flooding mechanism doesn´t be used in practice for a great amount of redundant generated during query propagated among network. Studies show rates of redundant messages generated are not equal in different stage, as the distance of the query propagated increase, the number of redundant message exponential growth. In this paper, we propose a search algorithm base on peers division to reduce redundant amount and retain the scope to propagate. Analysis of the key indicators shows it efficient in P2P searching.