A resource search method and device in an unstructured p2p network

Abstract

The invention relates to a resource search method and a resource search device of an unstructured P2P network, wherein the resource search method of the unstructured P2P network comprises the following steps: within message flooding survival time, a node forwards a search message to all neighboring nodes; when the flooding survival time is up, the node enters roaming search, the node forwards thesearch message to a neighboring node with highest out-degree value to continue searching, until roaming survival time of finding a target resource or message is zero; and a source node dynamically adjust the flooding survival time and the roaming survival time of next search according to a search result. According to the method and the device provided by the invention, advantages of two types of search algorithms of the unstructured P2P network are synthesized, meanwhile, resource search range and resource search cost both are considered, processing capability of network nodes are used, and efficiency of resource search is improved through making full use of neighboring node information.

Description

technical field [0001] The invention relates to the field of network communication resource search, in particular to a resource search method and device for an unstructured P2P network. Background technique [0002] In P2P networks, a very important challenge is how to quickly search for resources in the network. In unstructured P2P networks, each node cannot understand the topology and resource distribution of the entire network, and due to the dynamic characteristics of unstructured P2P networks, it is difficult for nodes to accurately grasp the global information of the entire network. Resource search provides P2P networks with the ability to locate the requested resource and route it to the target node. Therefore, ensuring the efficiency of resource search algorithms is critical to the performance of unstructured P2P networks. [0003] Resource search message forwarding strategy, that is, what standard is used to select neighbor nodes to forward resource search message...

AI Technical Summary

Problems solved by technology

Through the above method, the search cost can be greatly reduced, but the search time is relatively long, because RW only searches for one node per hop, and the covered network range grows linearly with time, which is far lower than the exponential growth of the Flooding method with the number of hops coverage of

Images