Research Of Resource Search Method In Peer-to-Peer Networks

With the widespread use of Internet and the continuously improved performance of computer system connected to the Internet, the rapid development of peer-to-peer computing pattern gradually makes it become one of the most important Internet applications. P2P networks ignore obvious difference between server and client. Nodes collaboration made by network interflow improved the utilization of resources and bandwidth; enhanced network expansibility, reliability.In order to utilize various resources in P2P networks, those resources should be effectively found first. Unlike other traditional systems, P2P systems demonstrate some special characteristics, such as large-scale and dynamic, which have brought many challenges to resource searching technique in the networks. Searching algorithms in P2P networks are researched and discussed in depth. Aiming to improve Flooding algorithm, which has many redundant messages in its long time query process, a new searching mechanism is proposed. It divides P2P networks into two levels. Effective DHT routing algorithms could be used for super peers in upper level because of their DHT topology. Searching algorithm base on Flooding algorithm is used for children peers in lower level. Super peer is able to dynamically adjust its scale according to the variety of network environment.The improved searching mechanism is tested in relevant P2P networks, which is simulated with network emulator. The simulation results show that new searching mechanism has better resource cost, hit probability and response time. Finally, summarization and prospect on the subject of this paper are given.