Information diffusion-based P2P network route control method

Abstract

The invention relates to an information diffusion-based P2P network route control method. The method comprises the following steps of: saving a hit probability table on each node in a P2P network, wherein the value of the probability that the node can successfully inquire a certain resource is saved in the table; setting a time to live (TTL) value for each piece of inquiry information to limit the forwarding depth of search information; pre-setting two information diffusion periods, namely Ts and Tf and setting a corresponding counter and a maximum information diffusion depth Dm for each typeof resource n on each node; forwarding information to neighboring nodes according to the current resource hit probability of the node on a search path and gradually updating the current hit probability information of the resource i of the node; and when a search success counter of a certain node i in the network reaches the set information diffusion period Ts or a search failure counter of the node i reaches Tf, allowing the node to start an information diffusion process and allowing the neighboring nodes to update the current hit probability of the node i according the history hit probability and the current hit probability periodicity of the node.

Description

technical field [0001] The invention relates to computer network communication technology, in particular to a probability-based resource routing search method in a P2P network. The algorithm can guide query requests to adapt to changes in resource routing caused by dynamic joining and withdrawal of network nodes, and search for P2P network resources more effectively. Background technique [0002] All nodes in the P2P peer-to-peer network are on an equal footing, and each node can serve as a server to provide resources or services, and at the same time it can serve as a client to request resources. Since there is no central server in the P2P network, information can be directly exchanged between adjacent nodes; therefore, the P2P network is a typical distributed network, and its structure is not only easy to realize the extensive sharing of network resources, but also conducive to the distribution of resources. Application of computing, storage and other technologies. P2P ne...

AI Technical Summary

Problems solved by technology

[0004] In summary, the existing resource search routing methods of unstructured P2P networks are all based on topologically stable search methods. There is no good solution for resource search with dynamically changing network topology. It is necessary to study the dynamic topology of P2P networks. The resource routing control method under the structure enables the resource routing changes brought about by the dynamic changes of the P2P network topology to be reflected in time to each node of the network, thereby improving the search efficiency of network resources

Images