Research Of Data Resources Sharing Based On P2P

With the rapid development of computer networks, the scale of networks are getting more bigger and network resource information is also growing in an explosive way, in the mass of these resourses in network,how to quickly and effectively locate the information that people want has become a focus of concern. In the traditional Client/Server mode network, search algorithm mostly depends on the server,however,with the growth of the number of resources,the server’s burden is getting more and more heavy, this may result in the low efficiency in search algorithm and the paralysis of this network. In this case, P2P technology has born out and quickly been applied in many aspects.P2P networks eliminating the concept of client and server, and avoid making the whole networks failuring because of the server’s overload.The resources in this network is stored on each node in a distributed way, each node collaborate to provide services to users.First,this paper introduces the basic concepts of P2P technology and to analysis its advantage,we compared it to the traditional web site model. Then introduces the model of three major P2P networks and the resource search algorithms which are based on DHT technology. Although this kind of algorithm can meet the demand of people to a certain extend, they can only support a single keyword search, which can not support complicated search.In this case,we propose a search algorithm which can support multi-keyword. In this algorithm,the Bloom Filter is used to compress the data to save the storage space of each node and reduce the network traffic.By creating index, this algorithm improves search efficiency.Finally,we use the PeerSim simulation tools to test the effect of the algorithm and compare the hit rates, the delay rates and the network traffic that generated in searching process with other different algorithms.