Research On Search In Peer-to-Peer Networks

Allowing file exchange among the end client peers through Internet is the initial purpose of peer-to-peer. In the short history of P2P applications, it has become one of the main application types that consume a large fraction of Internet traffic. P2P architecture has begun to show its capability to support massive users, and this capability makes it suitable for rapidly deploying powerful and large-scale distributed applications with low cost.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. Combining the advantages of BFS and the characteristics of P2P networks, the paper proposed a DBFS approach, the main researches as follows:Firstly, the basic concepts about P2P have been introduced, including the growth, applications, development status in quo and the differences between P2Pand C/S.Secondly, the evaluate criterions about search in P2P have been presented, the search method that is being employed has been discussed and the methods that were put forward by researchers have been analyzed.Thirdly, the reason why redundant search packets come into being in P2P networks has been argued. In order to reduce redundancy, a DBFS search method has been presented. This method has been expatiated in the paper, the correctness and complexity about it has been analyzed.Finally, programming has simulated DBFS and flooding and some result has been got.