The Research On The Method Of Locating Peer-to-Peer Networks' Resources

P2P model is one of the most important applications in Internet. Resource locating is the pre-condition to realize the share of resource in Internet. By now, there have been a lot of methods to locate resources, such as flooding, random walk, and search on basis of distributed hash table. However, these methods have more or less demerits, such as too many searching packets, long response time, and high cost on systematic node maintenances. This paper researches the issues of locating the resources in p2p networks. It mainly includes:First, on the basis of others' research achievement, this paper put forward the standard of remarking the searching method. To analyze the flooding method's characteristics and the reasons why it will cause so ponderous packets on networks, a pyramid network model for P2P is proposed. On this basis, the paper provides a kind of optimized method called Telling-flooding scheme. In this scheme, every node maintains neighbor nodes'information within 2 hops, such as the node'forwarding tables. By using this scheme, the number of ponderous packets can be reduced.Analysis and experiments show that this scheme can reduces the amount of needless packets, meanwhile has characteristics both of short response time and the economized cost of maintenances of nodes.With the structure-less Gnutella networks model and structured Chord network model's merits, this paper proposes a mixed model for network searching. This model divides the network into reasonable domains, to scale down the whole networks; and it utilizes the diversity of node, to make the network that is made up by the interface nodes more comparatively stable. In order to make the number of nodes in domain suitable, and to reach the goal of dynamically separate and combine domain, the concept of individual zone space is introduced. This paper gives off a sort of explications to tell the procedure of adding and removing nodes, and tell the new mechanic about the route refreshing. Analysis and experiments demonstrates that the mixed network model has advantage of generating less selecting messages and cutting down the total costs on maintaining information of node.Moreover, in order to simulate the environment of p2p network, a searching simulator is designed. The rules of design and the procedure of realizing the simulator are described. And two examples of searching experiment are given.