System and method for broadcasting message in structural peer-to-peer network

Abstract

The invention discloses a system and method for broadcasting a message in a structural peer-to-peer network to complete message broadcasting in the structural peer-to-peer network. In the method, a message is broadcast stage by stage from an initial node, and each stage at least comprises a broadcasting node; in each stage, the broadcasting node determines the broadcasting range of the current stage, indicates the broadcasting range of the next stage and broadcasts the message to a receiving node of the current stage in accordance with the broadcasting range of the current stage, and after receiving the message, the receiving node of the current stage is used as the broadcasting node of the next stage to continue to broadcast the message; and when no receiving node in a certain stage can be used by the broadcasting node for determining the broadcasting range of the current stage, the broadcasting node of the current stage stops broadcasting, wherein the broadcasting node in the first stage is the initial node. The invention realizes that the message can be quickly broadcast to all the nodes in the network without relevance to specific network topology and routing protocols, thereby being applicable to multiple networks based on distributed hash tables.

Description

technical field [0001] The invention relates to the communication field, in particular to a message broadcasting system and method in a structured peer-to-peer network. Background technique [0002] Peer-to-Peer (Peer-to-Peer, P2P, or peer-to-peer) technology allows users to directly connect to other users' computers for file sharing and exchange. At the same time, P2P technology is also widely used in deep search, distributed computing and collaborative work. [0003] A distributed P2P network usually builds a routing table based on a Distributed Hash Table (DHT) for addressing and storage. An important feature of the DHT-based P2P network is that there is no strict central server in the network, but the overlay network has a strict topology structure. Usually, a node can only see part of the topology of the overlay network and is responsible for storing a small part of data. [0004] figure 1 It is a schematic structural diagram of a DHT network in the prior art. like ...

AI Technical Summary

Problems solved by technology

Common P2P message broadcast algorithms, such as web crawlers based on the Gnutella protocol, are used to collect P2P nodes, search or count shared file information on the overlay network, etc. The basic principle is the broadcast mechanism of flooding, and many existing algorithms are also based on the flooding method. Improvements, such as limiting the width of the flood search, etc.

[0006] When the inventor realizes the present invention, it is found that there is at least this defect in the prior art: when the aforementioned message broadcasting method is used in a large-scale DHT network with hundreds of thousands, millions or even more nodes, it is easy to generate redundancy news, causing the network to be overloaded and triggering a network storm

In addition, there is a single-hop DHT network message broadcast algorithm based on each node knowing the global network topology, which is not applicable to typical multi-hop DHT networks

Images