Balanced quick searching method in structureless P2P (Peer-to-Peer) network

Abstract

The invention relates to the technical field of peer-to-peer (P2P) networks, in particular to a balanced quick searching method in a structureless P2P network. The method comprises the following steps of: receiving a query message by a node, searching whether an object file is received at home, if yes, then searching successfully, and updating hitting capability and load per se; judging whether the life cycle of the query message is expired in the node, if yes, then not transmitting the message, or else selecting the next node to transmit; determining a transmission list according to the information of a neighbor node list; transmitting the message to a node in the transmission list; and updating the load of the node. The invention obviously increases the throughput rate of the system, increases the search hitting rate, reduces the average searching delay and saves the network expenses under the condition of avoiding node congestion in the network as much as possible.

Description

technical field [0001] The invention relates to the technical field of peer-to-peer (Peer-to-Peer, P2P), in particular to a balanced fast search method in an unstructured P2P network. Background technique [0002] In recent years, the rapid growth of P2P software users has made the system face greater search pressure. Although many efficient search algorithms have been proposed to achieve better performance, such as higher search success rate, hit rate, shorter search delay and less overhead, etc., the assumption is that the network The status is good, the load between nodes is balanced and no network congestion will occur. And this assumption is difficult to establish in reality, because the capacity of nodes is limited, that is, they can only bear limited load, and once the load of a node exceeds the maximum load it can bear, it will cause congestion, and congestion will bring There are two consequences: one is that the response speed of the node to the message becomes s...

AI Technical Summary

Problems solved by technology

The difference in node capabilities leads to obvious differences in the efficiency of nodes in message processing. Nodes with strong capabilities can process more messages, while nodes with weak capabilities are relatively more prone to queuing

2) There are large differences in the shared files of nodes

[0005] Because in the P2P environment, a single node cannot accurately understand the global load distribution information and the balance of user queries, making it a difficult problem to balance the load of each node

Therefore, a major challenge in P2P networks is how to design a message routing protocol that not only enables the nodes in the network to achieve load balancing, but also makes the average search path as short as possible.

Images