Research Of Distributed Search Technology Based On P2P

With the increase of storage space and the decline of memory price, individual users also have a lot of resources which can be shared. In recent years, the use of P2P (peer-to-peer, called P2P) file sharing technologies for the computer industry has aroused concern. But how to find the resources which we need from a lot of resources shared in P2P network, becomes an urgent problem to be solved, so it is very important to find a good P2P search method.Gnutella, typical P2P network, searched with the method of flooding, but brought great pressure to network because of redundant message. In this paper, a new P2P search method called RSTree was proposed. On the basis of characteristics of small world in P2P network, the network topology was transformed into tree topology by RSTree method, meanwhile, RSTree method combined the breadth advantage of selecting random neighbors method. RSTree method significantly reduced the redundant information while guaranteeing the search success rate.First, the concept of P2P network was expatiated, the differences of P2P and Client/Server were analyzed. The classification, features and applications were introduced. Second, several different P2P search technology was analyzed from the perspective of topology. At last, the RSTree method details were introduced. The origin of the RSTree, the idea of method, main steps and the algorithm complexity were described in this paper. The method was simulated.