P2P network information resource location method having constant hop routing characteristic

Abstract

Disclosed is a method of positioning P2P network information resource with constant hop routing feature, relating to the computer network technology field, aiming at solving the technical problem of positioning P2P network information resource of the computer network. The resource positioning method is characterized in that: 1) the method is the first information resource positioning algorithm which completes the information request inside d routing hops with the probability 1-c ( c is a constant and can be set ), and the routing delay is a constant and is not enlarged with the network scale enlarged; 2) the method combines random neighbor strategies and DHT rings, the neighbor number space complexity of each node is referred to the illustration, and as the random neighbor selecting strategy is used, the maintenance work of the node neighbor is simpler. The resource positioning method has good time, space and communication complexity and is easy to be realized with simple structure.

Description

technical field [0001] The present invention relates to computer network technology, in particular to an algorithm capable of completing information resource positioning for query requests within a constant hop route and a corresponding P2P (Peer to Peer, peer-to-peer network) network framework method. increase with increasing size. Background technique [0002] In a P2P system, data may exist on any node in the network. Therefore, how to efficiently locate the nodes storing specific data has become a fundamental problem. Napster (an online music service, the first widely used peer-to-peer network music sharing service) utilizes a centralized directory system for resource location, and the single point of failure problem is obvious. The practical Gnutella (a practical file sharing network based on P2P network) and KaZaA (another file sharing network) are based on the flood search mechanism, but will generate a large amount of communication load in large-scale networks. In...

AI Technical Summary

Problems solved by technology

[0005] Aiming at the above-mentioned defects in the prior art, the technical problem to be solved by the present invention is to provide a query request that can be processed within the query routing hops whose computational complexity is constant, and can overcome the limitations of the existing P2P network due to network scale and network constraints. Influenced by fluctuations, as well as the increasing length of the routing table and the number of routing hops, the problem of reduced query efficiency is a P2P network information resource positioning method with constant hop routing characteristics.

Images