The Research Based On History Record On P2P Network Resources Searching

The P2P network (peer-to-peer network) technology is the new model in the Internet toimplement distributed computing, and its goal is to use the resource on Internet reasonably andefficiently, and to release the huge edge resource on the Internet in order to realize informationsharing, instant messaging and super computing etc. The P2P technologe is widely used intoday’s Internet, and is listed as one of the four key technologes in the Internet by AmericanFortune Magazine. However, the computer network is a complex network which is widelydistributed, has huge number of users, and the behavior of its node is not controlled. So it is adifficult problem to realize resource searching service efficiently for P2P network.The low efficiency of resources searching and large amount of information redundancy isthe main problems of unstructured P2P network. To resolve this problem, an advanced resourcesearching strategy is given in this paper. The successful searching result is saved as historyrecord, and is used to establise friend-node list, which can be great use to later resourcesearching. Compared with other nodes in the net, friend-nodes has the characteristics of richresources, thus the success rate of resources searching is high on the friend-nodes. Whenresource searching uses two-step searching, which can make resource searching informationoverlay most of the nodes in the network.This paper is focus on the unstructured P2P network, and the main research work of thistext includes the following aspects:1. This paper analyzes the research background and significance of P2P network resourcesearching, and introduces the development history of P2P file sharing system in our country andforeign county. This paper also introduces the several existing network topology and resourcesearching algorithm, and analyzes their advantages and disadvantages.2. This paper puts forward the concept of history record, and uses the broadcastingalgorithm to broadcast the history record. The history record is generated in the resourcesearching process in the P2P network, which can produce reference for later resource searchingand is the information collection of data structured. When one node successfully get the rightresource information, an history record generates, then this history record is broadcasted to othernode in the network. Resource searching firstly matches the existing information in the historyrecords, if fails then uses the other basic resource searching algorithm.3. This paper uses the history record to make the friend-node list for the nodes in the P2Pnetwork. Compared with other nodes, friend-node has rich resources, and has the same interestwith the searching node, and can make the resource searching successful to a large extent. Thispaper also designs new resource algorithm, which is the to-step flooding searching algorithm. Itmakes the resource searching information broadcasted to the friend-node, which can make theresource searching successful to a large extent, therefore improves the P2P network resourcesearching to some extent. 4. To validate and simulate all the work on the text. This paper chooses the PeerSim as thesimulation tool, which is prepared by Java language, and supports the platform transplantation.The experiment is made on one PC, before the experiment all the files and simulation parametersare all configured. The measure standards are the path length and network communicationoverheads when search successfully, and the reference algorithm is the Flooding searchingalgorithm. The simulation results show that the resource searching algorithm is effective, whichcan improve the efficiency of the unstructured P2P network resource searching.