P2p Search Algorithm

In this paper, peer to peer network model and its principle are introduced .In order to utilize a variety of resources in P2P networks, the most important thing is to find those resources. Because P2P networks is dynamic and scale, it is difficult to design an excellent search mechanism. In P2P system, each node is both a client and a server, and all data interchange can be finished among the nodes. Gnutella is a kind of complete distributed, P2P network model without rank structure, it can fit the natural characteristic that the node frequently joins and leaves in P2P network .It has character of robustness , real-time, dependability, and balanced load. More and more software based on the Gnutella protocols had been developed. A large number of users use such kinds of software to search message, download files, and share the data in Internet. However, some kinds of problem we describe as follow have been existed in Gnutella network, The first too many redundant messages, shortcut effect is most by this problem. The second is low search efficiency; the third and the last is reach ability question. By analyzing Gnutella protocol, a new routing is proposed, which can effectively improve its scalability and redundancy in the transmission of information and eliminate shortcut effect by redefine the flooding query's control mechanism.