Self-adapted search method for resource level

Abstract

The invention discloses a resource searching method of a peer-to-peer network based on a grade self-adaptation. The invention comprises the following steps: 1) a super node is evaluated independently by utilizing the self-contribution of a statistical result evaluation node of accessing histories, which is taken as a searching basis; 2) a resource searching way of expanding to the depth of the super node and the width of other neighbor nodes is applied; 3) a heartbeat detecting mode which is relevant to a neighbor node grade is set up, and a water wave diffusion algorithm is integrated to carry out a classified and graded searching. The invention considers a non-structural peer-to-peer network and generally takes a broadcasting way as a basic strategy of the searching, which lead to a larger network flow capacity. Therefore, an improved searching strategy is put forward to reduce flooding range, decrease network spending and increase resource searching efficiency.

Description

technical field [0001] The invention belongs to the technical field of Internet communication and relates to a query method for network resources. The purpose of the method is to improve the resource search performance of the distributed network in view of the large network traffic caused by broadcasting as the basic search strategy of the unstructured peer-to-peer network. Background technique [0002] P2P network is a new network topology, which shows great advantages in many fields such as file sharing and peer-to-peer computing, especially the unstructured P2P network (such as Gnutella) is less affected by nodes frequently joining and exiting the system, so it has Better usability. It does not have an index server, and uses a completely random graph-based flooding (Flooding) discovery and random forwarding (Random Walker) mechanism. In order to control the transmission of the search message, it is implemented by decrementing the TTL (Time To Live). However, the result...

AI Technical Summary

Problems solved by technology

But the cost of only a small number of routing states per node is the high latency of the discovery algorithm, because each search needs to contact multiple nodes, which is unnecessary in a stable network

[0005] In addition, there are large differences between nodes in the network. These devices have great differences in computing power, storage space, and battery capacity, and the actual network is divided into different autonomous areas by routers and switches, reflecting a strict hierarchy. , so that these nodes cannot allocate tasks according to their respective processing capabilities

Images