CN117135164A - Message transmission method suitable for non-fully connected block chain network - Google Patents

Abstract

The invention discloses a message transmission method suitable for a non-fully connected blockchain network. Firstly, clustering and grouping the nodes of the non-fully connected blockchain network to obtain the network topology of a grouping structure. The nodes in the group adopt multicast to carry out message transmission, and the message transmission is carried out between the groups through key nodes. In the whole network topology, a source node transmits a message to a target node, the message is transmitted to the key nodes of the group, then message multicasting is carried out among the key nodes until the group where the target node is located is found, and the message is transmitted to the target node through the key nodes of the group, so that the transmission efficiency is greatly improved. Meanwhile, the invention uses a self-defined multicast method, and the method can forward the message from the source node to the target node and learn the path to the target node under the non-fully connected network topology. And then combining a grouping mechanism, thereby realizing an efficient message transmission method under a non-fully connected network.

Description

A message transmission method suitable for non-fully connected blockchain networks

Technical field

The invention relates to an optimization method for blockchain network self-discovery in the field of blockchain technology, and specifically relates to a message transmission method based on a grouping mechanism that is adapted to non-fully connected blockchain network discovery.

Background technique

In a consortium chain scenario involving multiple institutions, it is difficult for some institutions with weak IT capabilities to open up the physical network, and it takes a long time to open up the physical network. Therefore, it is expected that the blockchain can realize efficient (consensus) message forwarding function of non-directly connected nodes.

In the existing network scenario, we are faced with the problems of high redundancy of node discovery messages and slow node discovery speed in the network. There are generally three forms of message transmission in the network: unicast, broadcast and multicast. For unicast and multicast, unicast and multicast in the existing blockchain are limited to transmission between direct communication links or forwarding by designated relay nodes, which cannot solve the transmission problem over multi-hop distances. As for broadcasting, although the broadcast protocol currently used in the blockchain can solve the problem of no direct communication connection between nodes, the convergence speed and coverage have always been challenges faced by the broadcast protocol, which will affect the throughput and delay of the system. etc. Therefore, the broadcast protocol cannot be directly applied to non-fully connected networks. Therefore, it is very important to study efficient message transmission algorithms in non-fully connected blockchain networks.

Contents of the invention

In order to solve the problems and needs existing in the background technology, the purpose of the present invention is to provide a message transmission method adapted to the discovery of a non-fully connected blockchain network, so as to realize message transmission in a non-fully connected blockchain network environment. the goal of. The present invention can realize deterministic network message delivery under normal conditions in the physical network environment. At the same time, based on the grouping mechanism, it greatly improves the efficiency of network node discovery and realizes an efficient message transmission mechanism under the blockchain non-fully connected network.

The technical solution adopted by the present invention is:

1) After clustering and grouping the nodes of the non-fully connected blockchain network, the network topology of the group structure is obtained;

2) Use the multicast method to perform intra-group and inter-group path learning on the network topology of the group structure, obtain the intra-group path graph and the path graph of key nodes between adjacent groups, and store them in the corresponding intra-group key nodes, thereby updating Network topology of group structure;

3) When a message is transmitted from the source node to the target node, first check whether the current source node stores a path graph to the target node. If so, perform unicast transmission from the current source node to the target node according to the current path graph; otherwise, Based on the key nodes of the group where the current source node belongs, use the multicast method to learn paths from key nodes of other groups until the key nodes of the group where the target node belongs are found, and then transmit messages to the target node within this group through the key nodes of the group where the target node belongs. .

In the network topology of the group structure, each group is composed of at least 2 key nodes and multiple common nodes connected in a non-fully connected manner.

In 2), when the multicast method is used to learn the path within the group in the network topology of the group structure, the source node and the target node are both nodes in each group, and all nodes in the current group are recorded as consensus nodes.

When using the multicast method to perform inter-group path learning on a network topology with a group structure, the source node and the target node are key nodes in different groups in the two adjacent groups. All nodes in the current two adjacent groups are recorded as Consensus node.

When using the multicast method to perform path learning on the network topology of the current group structure, the source node and the target node are any nodes in the non-fully connected blockchain network, and all nodes in the non-fully connected blockchain network are recorded as consensus nodes.

The multicast method is specifically:

S1: Record the source node as the initial multicast node, and determine the target node list based on the target node;

S2: Add the nodes that exist in the target node list in the neighbor node list of the current multicast node to the next hop node list and remove them from the target node list;

S3: Traverse the consensus node list, add nodes that exist in the neighbor node list of the current multicast node and do not exist in the current next hop node list to the next hop node list, and add neighbor nodes that do not exist in the current multicast node List and nodes that do not exist in the current target node list are added to the forwarding node list;

S4: Put the current target node list and forwarding node list into the multicast message of the current multicast node and send it to each node in the next hop node list;

S5: Each node in the next hop node list is recorded as a multicast node. If the current target node list is empty, the forwarding ends; otherwise, each current multicast node continues multicast and updates based on the target node list and forwarding node list. , until the target node list is empty.

Each current multicast node continues multicast and updates according to the target node list and forwarding node list, specifically as follows:

Put the nodes that exist in the target node list in the neighbor node list of the current multicast node into the next hop node list of the current multicast node and remove them from the target node list, and put the nodes that exist in the forwarding node list. into the next hop node list and removed from the forwarding node list, update the target node list and forwarding node list and put them into the multicast message of the current multicast node, and then send them to each node in the corresponding next hop node list and as a new multicast node.

The beneficial effects of the present invention are:

1) Realize message forwarding in a blockchain non-fully connected network environment.

2) Set the network topology to node grouping mode to improve the efficiency of message forwarding.

3) Using a customized multicast method for path learning, the convergence speed is faster.

4) Use discovered paths for message forwarding to reduce message redundancy and increase speed. After a node joins the network, it will continue to learn new paths from the network.

Description of the drawings

Figure 1 shows the network topology diagram of node grouping.

Figure 2 shows the multicast method oriented to the transmission method of non-directly connected nodes.

Detailed ways

The present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments.

The present invention sets the non-fully connected blockchain network into a topological structure of adjacent node groups, thereby reducing message redundancy and improving message transmission efficiency. At the same time, an efficient multicast method is customized to realize communication and path learning between non-directly connected nodes. The present invention integrates the two mechanisms to realize an efficient message transmission mechanism under a non-fully connected network. The present invention specifically includes the following steps:

1) After clustering and grouping the nodes of the non-fully connected blockchain network, the network topology of the group structure is obtained;

In the network topology of group structure, each group consists of at least 2 key nodes (one main key node and several backup key nodes) and multiple ordinary nodes connected in a non-fully connected form, as shown in Figure 1. 1, 2, 3, 4, 5, and 6 are group numbers. There are 2 black dots in each group that are key nodes. One key node is the main key node, the other key node is the backup key node, and the white dots are is an ordinary node.

2) Use the multicast method to perform intra-group and inter-group path learning on the network topology of the group structure, obtain the intra-group path graph and the path graph of key nodes between adjacent groups, and store them in the corresponding intra-group key nodes. Specifically, Each intra-group path graph is stored in the corresponding intra-group key node, and the path graph of each adjacent inter-group key node is stored in the corresponding intra-group key nodes in two adjacent groups, thereby updating the grouping structure. Network topology;

3) When a message is transmitted from the source node to the target node, first check whether the current source node stores a path graph to the target node. If so, perform unicast transmission from the current source node to the target node according to the current path graph; otherwise, Based on the key nodes of the group where the current source node belongs, use the multicast method to learn paths from key nodes of other groups until the key nodes of the group where the target node belongs are found, and then transmit messages to the target node within this group through the key nodes of the group where the target node belongs. .

In 2), when the multicast method is used to learn the path within the group in the network topology of the group structure, the source node and the target node are both nodes in each group, and all nodes in the current group are recorded as consensus nodes.

2), when the multicast method is used to learn the path between groups in the network topology of the group structure, the source node and the target node are key nodes in different groups in the two adjacent groups, and the current nodes in the two adjacent groups are All nodes are recorded as consensus nodes.

In 3), when using the multicast method to perform path learning on the network topology of the current group structure, the source node and the target node are any nodes in the non-fully connected blockchain network, and all nodes in the non-fully connected blockchain network are recorded as Consensus node.

As shown in Figure 2, the multicast method is specifically:

S1: When the message source node needs a multicast message, the source node is recorded as the initial multicast node, and the target node list TargetNodes is determined based on the target node. At least one target node is set;

S2: Add the nodes that exist in the target node list in the neighbor node list of the current multicast node to the next hop node list and remove them from the target node list, and update the target node list;

S3: Traverse the consensus node list, add nodes that exist in the neighbor node list of the current multicast node and do not exist in the current next hop node list to the next hop node list, and add neighbor nodes that do not exist in the current multicast node List nodes that do not exist in the current target node list are added to the forwarding node list FarwordNodes;

S4: Put the current target node list and forwarding node list into the multicast message of the current multicast node and send it to each node in the next hop node list;

S5: Each node in the next hop node list is recorded as a multicast node. When each multicast node receives a multicast message, it first obtains the TargetNodes field in the multicast message, records it as a target node list, and obtains the multicast message. The FowardNodes field in the message is recorded as the forwarding node list; if the current target node list is empty, the forwarding ends; otherwise, each current multicast node continues multicast and updates according to the target node list and the forwarding node list until the target node list is If empty, the path graph from the source node to the target node is stored in the key node of the group where the source node is located;

Each current multicast node continues multicast and updates according to the target node list and forwarding node list, specifically:

Put the nodes that exist in the target node list in the neighbor node list of the current multicast node into the next hop node list of the current multicast node and remove them from the target node list, and put the nodes that exist in the forwarding node list. into the next hop node list and removed from the forwarding node list, update the target node list and forwarding node list and put them into the multicast message of the current multicast node, and then send them to each node in the corresponding next hop node list and as a new multicast node.

Among them, the unicast algorithm specifically includes the following sub-steps:

First, path learning is performed, and nodes learn forwarding paths from multicast messages. Routing messages are no longer used alone to enable nodes in the network to learn paths, reducing message redundancy. When a multicast message passes through a hop node, the hop node information is added to the Path field of the message, and then the message containing the path information is forwarded to the next hop node. After the next hop node receives the message, it can A path to the source node is obtained, so the target node will learn multiple paths to the source node. Sort the paths according to path cost, set an upper limit on the number of paths, and cache path information;

Then, because the network topology changes from time to time, the path information changes accordingly. Therefore, a path update algorithm is required to update the path information in real time and detect the validity of the path through a timing detection mechanism.

When the message is finally propagated, the path with the lowest path cost is given priority to forward the message.

The above are only preferred specific embodiments of the present invention, but the protection scope of the present invention is not limited thereto. Any person familiar with the technical field can, within the technical scope disclosed in the present invention, implement the technical solutions of the present invention. Equivalent substitutions or changes of the inventive concept thereof shall be included in the protection scope of the present invention.

Claims (7)

1. A message transmission method suitable for a non-fully connected blockchain network, comprising the steps of:

1) Clustering and grouping the nodes of the non-fully connected blockchain network to obtain a network topology of a grouping structure;

2) The method comprises the steps of utilizing a multicast method to learn paths in and among groups of network topology of a packet structure, obtaining path diagrams in the groups and path diagrams of key nodes among adjacent groups, and storing the path diagrams in the corresponding key nodes in the groups, so as to update the network topology of the packet structure;

3) When a message is transmitted from a source node to a target node, firstly checking whether a current source node stores a path diagram to the target node, and if so, carrying out unicast transmission from the current source node to the target node according to the current path diagram; otherwise, based on the key node of the current source node, path learning is carried out to the key nodes of other groups by using a multicast method until the key node of the group of the target node is found, and then the message is transmitted to the target node in the group through the key node of the group of the target node.

2. A method of message transmission for a non-fully connected blockchain network as in claim 1 wherein each group in the network topology of the packet structure is comprised of at least 2 critical nodes and a plurality of common nodes connected in a non-fully connected fashion.

3. The message transmission method for a non-fully connected blockchain network according to claim 1, wherein in the 2), when the multicast method is used to learn paths in groups for the network topology of the packet structure, the source node and the target node are nodes in each group, and all nodes in the current group are identified as consensus nodes.

4. The method for message transmission in a non-fully connected blockchain network according to claim 1, wherein in the 2), when the multicast method is used to perform inter-group path learning on the network topology of the packet structure, the source node and the target node are key nodes in different groups of two adjacent groups, and all nodes in the two adjacent groups are currently marked as consensus nodes.

5. The method for message transmission in a non-fully connected blockchain network according to claim 1, wherein in 3), when a multicast method is used to perform path learning on a network topology of a current packet structure, a source node and a destination node are any node of the non-fully connected blockchain network, and all nodes of the non-fully connected blockchain network are identified as consensus nodes.

6. A method for message transmission in a non-fully connected blockchain network according to any of claims 1, 3, 4 or 5, wherein the multicast method specifically comprises:

s1: marking a source node as an initial multicast node, and determining a target node list according to a target node;

s2: adding the node existing in the target node list in the neighbor node list of the current multicast node into the next-hop node list and removing the node from the target node list;

s3: traversing the consensus node list, adding nodes which exist in the neighbor node list of the current multicast node and do not exist in the current next-hop node list into the next-hop node list, and adding nodes which do not exist in the neighbor node list of the current multicast node and do not exist in the current target node list into the forwarding node list;

s4: the current target node list and the forwarding node list are put into a multicast message of the current multicast node and are sent to each node in the next hop node list;

s5: each node in the next hop node list is marked as a multicast node, and if the current target node list is empty, forwarding is finished; otherwise, each current multicast node continues multicasting and updating according to the target node list and the forwarding node list until the target node list is empty.

7. The message transmission method applicable to the non-fully-connected blockchain network according to claim 6, wherein each current multicast node continues to multicast and update according to the target node list and the forwarding node list, specifically:

the method comprises the steps of placing nodes existing in a target node list in a neighbor node list of a current multicast node into a next-hop node list of the current multicast node and removing the nodes from the target node list, placing nodes existing in a forwarding node list into the next-hop node list and removing the nodes from the forwarding node list, updating the target node list and the forwarding node list and placing the nodes into multicast messages of the current multicast node, and sending the multicast messages to each node in the corresponding next-hop node list as a new multicast node.