An Improvement Of Resource Searching Method In Peer-to-Peer System

During recent several years , Peer-to-Peer Networks have been focused on by the computer realm. According to the definition of Peer-to-Peer Working Group Committee, P2P can be used in the file sharing, distributed computing and so on. But file sharing is the dominent P2P application. How to locate desired files is one of the key issues. Gnutella networks model is the representative of pure P2P systems. At present the most softwares of the file sharing used are built on the Gnutella. The peers and its shared files are searched and found by flooding in Gnutella. When new peer joining the P2P net, the number of searching messages as well as the latency flux generated by every message is increasing. Those include many needless repeat messages and flux. Therefore , it is needed to research the file searching in Gnutella.Existent search mechanisms either only find some special peers and search files in those peers so that many available peers are ignored, or scale of indices peers is proportion of scale of shared files so that indices is too large. The thesis researches those points and imports the dynamic route idea, then introduces some main amendments, the keys are as follows:1. According to the similarity between path selection in P2P system and Internet route action, every peer is seen as a Router and builds its own route table;2. To find special peers and store their information in default column of the route table;3. To use methods(integration route table, or hop route table)to initiatively get the network changes and store those in the route table;The thesis compares the integration route table method and the hop route table method, then it compares the route table method and directed breadth first search method based on experiments, and draws conclusions.