CN115296824B - Hierarchical transmission method of block chain network based on multi-scale node management and storage medium - Google Patents

Abstract

The invention relates to a block chain network hierarchical transmission method based on multi-scale node management and a storage medium. And updating the adjacent nodes in each interval through the network transmission speed among the nodes, namely, replacing the old nodes with the nodes with higher transmission speed as the adjacent nodes of the nodes, and keeping the highest data transmission speed between the nodes and the adjacent nodes all the time. Based on the multi-scale node management model, when the transmission levels are different, the data sending node forwards the data to the adjacent node under the corresponding scale level; the invention reduces the transmission level, reduces the transmission delay, improves the network utilization rate and improves the maximum throughput.

Description

Blockchain network hierarchical transmission method and storage medium based on multi-scale node management

technical field

The invention relates to the technical field of block chains, in particular to a block chain network hierarchical transmission method and storage medium based on multi-scale node management.

Background technique

Due to its decentralization, anti-tampering, traceability and other characteristics, blockchain technology has been applied to information systems in some industries, and its integration with information technologies such as the Internet of Things, big data, and artificial intelligence can solve social credit problems. , cost, efficiency and other issues, to ensure the authenticity and credibility of the data, and to enhance the application value of the information system, it has a huge application prospect in various industries. However, the development and application of blockchain technology is at a critical stage where challenges and opportunities coexist. There are some challenges in terms of node storage block data pressure, data transmission time in the blockchain network, consensus efficiency, etc.; In the chain system, all nodes are formed into a P2P network. Factors such as network transmission efficiency, transmission reliability, security, and network utilization between nodes directly affect the stability and performance of the blockchain operation. With the continuous improvement of application requirements and the increasing number of transactions, a faster and more efficient network transmission method is required between nodes in the blockchain P2P network.

In the Bitcoin blockchain, nodes transmit new blocks to their neighbors in three ways: BIP130 mode only broadcasts complete block header data; BIP152 high-bandwidth mode uses compact block protocol to transmit complete block data immediately; INV mechanism only Broadcast block hash, the node first sends the INV message to its neighbors, and then only sends the complete data to the neighbors responding to the GETDATA message, which improves the transmission efficiency of complete data, but increases the number of network transmissions; in Ethereum , when a miner constructs a new block, the miner will send two different types of messages to its neighbors: NewBlockMsg (contains complete block data) and NewBlockHashesMsg (contains only block hashes), similar to the Bitcoin blockchain Similarly, the number of network transfers for Ethereum's second message type will increase.

Currently there are the following issues regarding blockchain technology:

1) The transmission efficiency of blockchain network is not high. Data is sent from one node to each node in the entire P2P network. It needs to be forwarded multiple times, which increases the time for data transmission to the entire network. There is a certain network delay in data transmission, and the network transmission efficiency is not high.

2) The utilization rate of the blockchain network is low. After each node in the P2P network receives the data, it forwards the data to other nodes. Each node may receive the same data sent by different nodes multiple times. Redundant data transmission causes waste of network resources and low network utilization. .

3) The performance of the blockchain network has become one of the important factors affecting the throughput of the blockchain. In the P2P network of the blockchain system, there are generally many nodes, and they are distributed in various parts of the world; in addition, the network status of each node is uncontrollable, and it is impossible to require the network bandwidth of the nodes, or even require them to be in a stable network. Nodes can go offline at any time, and new nodes can join at any time. Therefore, the synchronous data rate of the new node joining is low, and it will take a lot of time to obtain its own neighbor nodes.

Contents of the invention

A block chain network hierarchical transmission method and storage medium based on multi-scale node management proposed by the present invention can solve at least one of the above technical problems.

To achieve the above object, the present invention adopts the following technical solutions:

A blockchain network hierarchical transmission method based on multi-scale node management, comprising the following steps,

S1. Set the scale division strength n according to the scale of the entire blockchain network, that is, when the scale level Scale-level=1, the nodes in the network are divided into n intervals; when the number of nodes contained in each interval is less than or equal to the division strength When n, the new scale will not be divided;

S2. Initialize the neighbor node list; when a new node joins the network, according to its ID value, it is judged that the node is located in the interval when the scale level is Scale-level=1, and a node is randomly selected from the sibling intervals of this interval Add the adjacent node list of this new node; repeat this method, select the corresponding node at each other scale, and add its adjacent node list; the sibling interval of the node is all subintervals of the interval of the previous scale of the interval to which the node belongs;

S3, data sending;

S4. Data receiving and forwarding.

Further, the steps of scale division included in the step S1 are as follows:

(1) Arrange all the nodes in the network according to the ID value from small to large, and determine the division strength n;

(2) Set the scale level Scale-level=1, and divide the node set in the network into n intervals according to the degree of division, that is, interval 11, interval 12...interval 1n;

。 (3) When the number of nodes contained in each interval is less than or equal to the division strength n, the new scale will not be divided; at this time, the scale level Scale-level=k, the n ^k under the scale level k-1 ^-1 interval is equally divided into n intervals; if the number of node IDs is m, the calculated maximum value of the system scale is

.

Further, the initialization of the neighbor list in step S2 includes the following steps,

个邻节点； Local nodes have unique intervals at different scales. The parent interval of a node is the interval of the previous scale of the interval to which the node belongs, the child interval of the node is the interval of the next scale of the interval to which the node belongs, and the sibling interval of the node is All sub-intervals of the interval of the previous scale of the interval to which the node belongs; each node is at different scales, in all brother intervals, if a node is selected as its neighbor node, then at each scale, each node has n neighbors Node, if the number of node ID digits is m, then there are a total of

neighbor nodes;

When node a establishes a connection with another node c in the P2P network, node a determines the interval to which node c belongs under different scale levels according to the ID value of node c. When there is already a neighboring node b in this interval, then Node c is used as a backup node, and within a certain heartbeat period, node a compares the network response speed with node b and node c, if the network response speed with node c is greater than the network response speed with node b, then node c Replace node b to become the neighbor node of node a in the interval, otherwise, keep node b as the neighbor node of node a in the interval unchanged.

Further, the data sending in the step S3 includes the following steps,

When the data sending node sends the transaction and block data in the blockchain system, it first packs the data into a standard data format according to the relevant blockchain protocol, and at the same time attaches the transmission level data item. At this time, the data is sent for the first time. Therefore, the value of the transmission level is 1; and according to the value of the transmission level 1, the scale level is also determined to be 1, select all the neighboring nodes of the data sending node under the scale level, and send the data with the transmission level attached to these neighboring nodes of the node.

Further, the data receiving and forwarding in S4 includes the following steps. First, verify the received data, verify the validity of the transaction and block data, and at the same time verify the transmission level data items, the minimum value of which is 1, and the maximum value is 1. No more than the maximum scale level; then verify the signature of the transmission level to judge the validity of the signature; after the received data is verified, the judgment of data forwarding will be carried out, and the value of the transmission level in the received data will first be increased by 1 as the data To forward the scale level selected by the neighbor node, first judge whether the scale level exceeds the maximum scale level of the blockchain system; judge whether there is a neighbor node under the scale level, if there is no neighbor node, no longer forward the data, if it exists, then Forward data to these neighbor nodes.

Further, the data receiving and forwarding in S4 also includes that after the data is forwarded, the next batch of nodes receiving the data repeat the above data receiving and forwarding process until most of the nodes in the blockchain system P2P network have received the data.

Further, after the data in S4 is received and forwarded, it also includes new node joining/node exiting:

The network status of each node is uncontrollable, and the network bandwidth of the nodes cannot be required, and they cannot even be required to be in a stable network. Nodes can be offline at any time, and new nodes can join at any time;

When a new node joins, first calculate the ID value corresponding to the node, and then assign it to the corresponding interval through the interval divided by the blockchain node at the beginning, and then complete the entire block by updating the adjacent nodes update of the nodes of the chain;

When a node is offline or exits due to some factors, when the system updates the adjacency points, it will re-allocate new adjacency points to those nodes with the exit node as the adjacency point.

On the other hand, the present invention also discloses a computer-readable storage medium, which stores a computer program, and when the computer program is executed by a processor, the processor executes the steps of the above-mentioned method.

It can be seen from the above technical solution that the multi-scale node management-based block chain network hierarchical transmission method of the present invention proposes a multi-scale node management model. The method selects the division strength according to the scale of the block chain network, and divides the network node set For multiple scales, the nodes are divided into multiple uniform intervals according to the ID value at each scale, and one node is selected as the neighbor node of the transmission node in different intervals under different scales, and the neighbor node update based on the transmission speed is adopted. Way. The neighbor nodes in each interval are updated through the network transmission speed between nodes, that is, the node with faster transmission speed is used to replace the old node as the neighbor node of the node, so that the highest data transmission speed between the node and the neighbor node is always maintained. Based on the multi-scale node management model, at different transmission levels, the data sending node forwards the data to the adjacent nodes at the corresponding scale level; the invention reduces the transmission level, reduces the transmission delay, improves the network utilization rate, and improves the Maximum throughput.

Description of drawings

Fig. 1 is a schematic structural diagram of a multi-scale node management model of the present invention;

Figure 2 is a schematic diagram of the structure of adjacent nodes at different scales;

Fig. 3 is a schematic diagram of a transmission architecture based on a multi-scale node management model.

detailed description

In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments It is a part of embodiments of the present invention, but not all embodiments.

As shown in Figure 1, the blockchain network hierarchical transmission method based on multi-scale node management described in this embodiment includes the following steps,

S1. According to the scale of the entire blockchain network, set the scale and divide the strength n. That is, when the scale level Scale-level=1, the nodes in the network are equally divided into n intervals. When the number of nodes contained in each interval is less than or equal to the division strength n, the new scale is not continued to be divided.

S2. Initialize the neighbor node list. When a new node joins the network, according to its ID value, it is judged that the node is located in the interval when the scale level is Scale-level=1, and a node is randomly selected from the sibling intervals of this interval to join the neighbor nodes of this new node list; then repeat this method, select the corresponding node at each other scale, and add it to its neighbor list.

S3, data sending. When the data sending node sends data such as transactions and blocks in the blockchain system, it first packs the data into a standard data format according to the relevant blockchain protocol, and at the same time attaches a transmission-level data item. At this time, the data is sent for the first time. , so the transmission level value is 1; and according to the transmission level value 1, the scale level is also determined to be 1, select all the neighboring nodes of the data sending node under the scale level, and send the data with the transmission level attached to these neighboring nodes of the node .

S4. Data receiving and forwarding. First, verify the received data. To verify the validity of data such as transactions and blocks, at the same time, it is necessary to verify the transmission level data items, the minimum value of which is 1, and the maximum value does not exceed the maximum scale level; then the transmission level signature is verified to judge the validity of the signature . After the received data is verified, the judgment of data forwarding will be carried out. First, the transmission level value in the received data will be increased by 1 as the scale level selected by the adjacent node for data forwarding. First, it will be judged whether the scale level exceeds the blockchain system. The maximum scale level; judge whether there are adjacent nodes under this scale level, if there is no adjacent node, no longer forward data, if there is, forward data to these adjacent nodes.

The following are specific descriptions:

Set up the node management model, its functions are mainly divided into 6 main parts, namely: setting scale division strength, initialization of neighbor nodes, update of neighbor nodes, sending data, receiving and forwarding data, and adding new nodes that may be generated at any time /Exit of an existing node.

Scale division: In the blockchain system, the ID value corresponding to the node can be obtained according to the hash operation. Due to the characteristics of the hash operation, the calculated ID value of each node is unique, and the number of digits of the ID value of the node is determined. The concept of node scale is proposed in the system, and all nodes in the network are managed based on the multi-scale model. The division steps are as follows:

(1) Arrange all the nodes in the network according to the ID value from small to large, and determine the division strength n;

(2) Set the scale level Scale-level=1, and divide the node set in the network into n intervals according to the degree of division, that is, interval 11, interval 12...interval 1n;

(3) Set the scale level Scale-level=2, divide the n intervals under the scale level 1 into n intervals, for example, interval 11 is further divided into interval 21...interval 2n;

。 (4) When the number of nodes contained in each interval is less than or equal to the division strength n, do not continue to divide new scales. At this time, the scale level Scale-level=k, the n ^k-1 intervals under the scale level k-1 are divided into n intervals; if the number of node IDs is m, the maximum value of the system scale can be calculated as

.

Initialization of neighbor nodes: local nodes have unique intervals at different scales, the parent interval of the node is the interval of the previous scale of the interval to which the node belongs, and the child interval of the node is the interval of the next scale of the interval to which the node belongs. The sibling intervals of a node are all subintervals of the interval of the previous scale of the interval to which the node belongs. For each node at different scales, select a node as its neighbor node in all sibling intervals, then at each scale, each node has n neighbor nodes.

Neighbor node update: When node a establishes a connection with another node c in the P2P network, node a determines the interval to which node c belongs under different scale levels according to the ID value of node c. For node b, node c is used as a backup node, and within a certain heartbeat period, node a compares the network response speed with node b and node c, if the network response speed with node c is greater than the network response speed with node b , then replace node b with node c to become the neighbor node of node a in this interval. On the contrary, keep node b as the neighbor node of node a in this interval unchanged.

Sending data: When a data sending node sends data such as transactions and blocks in the blockchain system, it first packs the data into a standard data format according to the blockchain-related protocol, and at the same time attaches a transmission-level data item. Send once, so the transmission level value is 1; and according to the transmission level value 1, the scale level is also determined to be 1, select all the neighboring nodes of the data sending node under this scale level, and send the data with the transmission level attached to the node. these neighbors.

Data receiving and forwarding: After the node receives the data, it mainly verifies and forwards the data. The detailed steps are as follows:

(1) Data verification. To verify the validity of data such as transactions and blocks, at the same time, it is necessary to verify the transmission level data items, the minimum value of which is 1, and the maximum value does not exceed the maximum scale level; then the transmission level signature is verified to judge the validity of the signature .

(2) Data forwarding. After the received data is verified, the judgment of data forwarding will be carried out. First, the transmission level value in the received data will be increased by 1 as the scale level selected by the adjacent node for data forwarding. First, it will be judged whether the scale level exceeds the blockchain system. The maximum scale level; judge whether there are adjacent nodes under this scale level, if there is no adjacent node, no longer forward data, if there is, forward data to these adjacent nodes.

After the data is forwarded, the next batch of nodes that receive the data repeat the above data receiving and forwarding process until most of the nodes in the blockchain system P2P network have received the data.

New node joining/node exiting: The network status of each node is uncontrollable, and the network bandwidth of the nodes cannot be required, and they cannot even be required to be in a stable network. Nodes can be offline at any time, and new nodes can join at any time. When a new node joins, first calculate the ID value corresponding to the node, and then assign it to the corresponding interval through the interval divided by the blockchain node at the beginning, and then complete the entire block by updating the adjacent nodes The update of the nodes of the chain. When a node is offline or exits due to some factors, when the system updates the adjacency points, it will re-allocate new adjacency points to those nodes with the exit node as the adjacency point.

The node management model is the foundation and core of the blockchain system P2P network, and different blockchain systems have different node management methods. In order to improve the P2P network transmission efficiency and security of the blockchain system, a multi-scale node management model is designed. The overall structure of the model is shown in Figure 1.

In this model, the range of node ID values is evenly divided into multiple different intervals, and the smaller the scale level, the fewer the number of intervals. As shown in Figure 1, the scale level of scale 1 is the smallest, and the number of intervals is n; at scale 2, each interval of scale 1 is subdivided into n intervals, that is, there are n^2 intervals; at scale 3, the Each interval of scale 2 is subdivided into n intervals, that is, there are n^3 intervals; when the maximum scale level is scale k, there are n^k intervals. It can be seen that as the scale level increases, the number of intervals increases exponentially.

The interval to which a node belongs is the interval of the node ID value. Under different scales, each node has a unique interval. In the figure, node 0 belongs to interval 11 when the scale level is 1, and interval 11 when the scale level is 2. The section it belongs to is section 21. The parent interval of a node is the interval of the previous scale of the interval to which the node belongs. In the figure, when the scale level of node 0 is 2, the parent interval is interval 11. The subinterval of a node is the interval of the next scale of the interval to which the node belongs. In the figure, when the scale level of node 0 is 1, the subinterval to which the node belongs is interval 21. The sibling intervals of a node are all subintervals of the previous scale interval of the interval to which the node belongs. In the figure, when node 0 is at scale level 2, the sibling intervals are intervals 21, ..., interval 2n.

的最小整数。定义j为不同尺度 下的区间编号，最小值为1，最大值为

。则每个区间包含节点的最大数量

，每个区间内，节点ID最小值为 In order to better define the relevant parameters, m is defined as the number of digits of the node ID value. For any running blockchain system, m is certain. Define n as the number of intervals when the scale level is the smallest (ie 1); define k as the size of the scale level, the minimum scale level is 1, and the maximum scale level is greater than or equal to

The smallest integer of . Define j as the interval number under different scales, the minimum value is 1, and the maximum value is

. Then each interval contains the maximum number of nodes

, in each interval, the minimum node ID is

，节点ID最大值为

。

, the maximum node ID is

.

Each node that joins the blockchain P2P network needs to store a list of neighbor nodes in order to facilitate communication with other nodes. However, the number of nodes in the P2P network is too large to store all the nodes. A single node will select some neighbor nodes for storage.

In this model, a single node will select a node as a neighbor node in all sibling intervals at each scale. The adjacent node structures of nodes at different scales are shown in Figure 2. Taking the node whose ID is 0 as an example, when the scale level is scale 1, a node is taken from each interval from interval 11 to interval 1n as an adjacent node; similarly, when the scale level is scale 2, from interval 21 to interval Take a node from each interval of interval 2n as an adjacent node; until the scale level is scale k, extract a node from each interval from interval k1 to interval kn as an adjacent node.

A node has n neighbor nodes at each scale, so the node has kn neighbor nodes in total.

The multi-scale node management model can realize efficient management of nodes in the P2P network. At the same time, the network transmission based on this model can reduce the transmission level and improve the transmission efficiency of the network. The transmission level indicates the number of transmission layers that data needs to pass through from the sending node to the receiving node. The transmission architecture based on the multi-scale node management model is shown in Figure 3. When a node initiates data transmission (such as transaction or block data), the data transmission level value is 1, so as to determine that the scale level is also 1, select all neighboring nodes when the scale level of the sending node is 1, and attach transmission level data items (1 at this time), send data to these neighboring nodes.

The node receiving the data adds 1 to the transmission level value to determine the scale level (that is, 2) according to the additional transmission level value, selects all neighboring nodes of the node under the scale level, and attaches the transmission level data item (in this case, 2), forward data to these neighboring nodes.

By analogy, the data is continuously forwarded until the scale level in the received data reaches the maximum value, and this data broadcasting is completed.

To sum up, the embodiment of the present invention proposes a multi-scale node management model. Under different scale levels, the range of node ID values is evenly divided into several different intervals, and a node is selected as a neighbor node in each interval, and the neighbor node update method based on transmission speed is adopted. The neighbor nodes in each interval are updated through the network transmission speed between nodes, that is, the node with faster transmission speed is used to replace the old node as the neighbor node of the node, so that the highest data transmission speed between the node and the neighbor node is always maintained. A blockchain network hierarchical transmission model is proposed. Based on the multi-scale node management model, at different transmission levels, the data sending node forwards the data to the adjacent nodes at the corresponding scale level;

Specifically, the advantages of the embodiments of the present invention are as follows:

1. Reduction of transmission level

（1） Under the condition of a certain network bandwidth and the amount of transmitted data, the transmission time is related to the value of the transmission level. The smaller the value of the transmission level, the smaller the transmission time, and the higher the transmission efficiency; the larger the value of the transmission level, the more times the data is forwarded. The longer the time required for data transmission to the entire network, the maximum transmission level value of the multi-scale node management model is equal to the maximum scale value of the P2P network in the blockchain system plus one, which is:

(1)

Among them, m is the number of digits of the node ID value in the blockchain system. For any running blockchain system, m is determined; n is the number of intervals when the scale level is the smallest (ie 1), because each interval The number of neighbors in is 1, so its value is equal to the number of neighbors broadcast by the node each time it forwards data. In the formula, the larger m is, the larger the maximum transmission level value is; the larger n is, the smaller the maximum transmission level value is.

In Ethereum's structured P2P network, the maximum transmission level is:

（2）

(2)

为以太坊K桶中存储的最大节点数，为16，则根据式（2）的计算结果，以太 坊最大传输级别值为252。 Among them, m is also the number of digits of the node ID value, which is 256, and the number of K buckets in Ethereum is also 256.

is the maximum number of nodes stored in the K-bucket of Ethereum, which is 16, then according to the calculation result of formula (2), the maximum transmission level of Ethereum is 252.

In Ethereum, the number of neighbor nodes each time a node forwards a data broadcast is:

（3）

(3)

According to the calculation result of formula (3), the maximum number of neighbor nodes forwarded by each node is 64. If in this model, the number of neighbor nodes each time a node forwards data broadcasts is the same as that of Ethereum, which is also 64, then when this model is adopted, the maximum transmission level value is calculated to be 43 according to the calculation result of formula (1).

2. Reduction of transmission delay

为4+32个字节，可见增加的数据量是非常小的，而且其数据量 是固定大小的，不会随着传输级别值的增大而增大。因此，增加的数据量是可以忽略不计， 不影响传输效率分析结果。 When using this model to transmit data, it is necessary to attach the transmission level of each transmission and the signature data of the data sending node, and its size

It is 4+32 bytes. It can be seen that the increased amount of data is very small, and the amount of data is fixed and will not increase with the increase of the value of the transmission level. Therefore, the increased data volume is negligible and does not affect the transmission efficiency analysis results.

平均值为 20Mbps，m为256，

为16，根据传输级别值分析，以太坊传输级别值为252，本 模型传输级别值为43。则以太坊传输时延大小为： Taking Ethereum block data transmission as an example, the network transmission rate between nodes

Average is 20Mbps, m is 256,

It is 16. According to the analysis of the transmission level value, the transmission level value of Ethereum is 252, and the transmission level value of this model is 43. Then the transmission delay of Ethereum is:

（4）

(4)

The transmission delay of this model is:

（5）

(5)

为传输的数据量大小。以太坊区块高度为14581702的区块大小 为189,646Bytes[31]，以太坊P2P网络的传输时延大小为18.2秒，采用本模型的传输时延大 小为3.1秒；传输1MB左右大小的区块数据时，以太坊P2P网络的传输时延大小为100.8秒，采 用本模型的传输时延大小为17.2秒。 in,

is the amount of data transferred. The block size of the Ethereum block height is 14581702 is 189,646 Bytes[31], the transmission delay of the Ethereum P2P network is 18.2 seconds, and the transmission delay of this model is 3.1 seconds; the transmission of a block with a size of about 1MB For data, the transmission delay of the Ethereum P2P network is 100.8 seconds, and the transmission delay of this model is 17.2 seconds.

3. Improvement of network utilization

In the P2P network of the blockchain system, due to the repeated transmission during data forwarding, nodes often receive data forwarded by multiple neighboring nodes. Under the condition of the inter-node bandwidth and the amount of transmitted data, the main factor affecting the network utilization rate is the repetition rate of data transmission. The lower the transmission repetition rate, the higher the network utilization rate.

最多为64个。理想 环境下，节点发送一条数据，直接向网络内所有邻节点广播数据，网络中其它节点只收到一 次数据，传输次数为： According to formula (3), the number of neighbor nodes each time a node forwards data broadcast

The maximum is 64. In an ideal environment, a node sends a piece of data and directly broadcasts the data to all neighboring nodes in the network. Other nodes in the network only receive the data once, and the number of transmissions is:

（6）

(6)

The transmission repetition rate is defined as the ratio of the actual number of transmissions to the number of transmissions under ideal conditions. The analysis of the number of transmissions is shown in Table 1.

Table 1 Analysis of transmission times and repetition rate

MsP2P网络的传输 重复率为2.0左右，而DevP2P网络的传输重复率为64左右。

The transmission repetition rate of the MsP2P network is about 2.0, while that of the DevP2P network is about 64.

4. The maximum throughput has been improved

The throughput of the blockchain is one of the main indicators of the performance of the blockchain. There are many factors affecting its size. The internal influencing factors include: consensus mechanism, data structure, encryption algorithm, transaction verification, P2P network, etc.; external influencing factors include Node CPU performance, memory size, hard disk capacity, network bandwidth and other resources.

为： The impact of the blockchain network on the throughput of the blockchain includes network structure, bandwidth, etc. Under the condition that the network bandwidth is determined, the maximum throughput of the blockchain system

for:

（7）

(7)

为20Mbps时，交易的平均大小

为250字节时，根 据式（7）的计算结果，MsP2P网络的最大吞吐量

为： Network Bandwidth Between Nodes

Average transaction size at 20Mbps

When is 250 bytes, according to the calculation result of formula (7), the maximum throughput of MsP2P network

for:

（8）

(8)

为： And the maximum throughput of the DevP2P network

for:

（9）

(9)

The maximum throughput of the MsP2P network is 5243tps, while the maximum throughput of the DevP2P network is 163tps.

In another aspect, the present invention also discloses a computer-readable storage medium storing a computer program, and when the computer program is executed by a processor, the processor is made to perform the steps of any one of the above methods.

In another aspect, the present invention also discloses a computer device, including a memory and a processor, the memory stores a computer program, and when the computer program is executed by the processor, the processor executes any one of the above methods A step of.

In yet another embodiment provided by the present application, a computer program product including instructions is also provided, which, when run on a computer, causes the computer to execute the steps of any one of the methods in the above embodiments.

It can be understood that the system provided in the embodiment of the present invention corresponds to the method provided in the embodiment of the present invention, and the explanations, examples and beneficial effects of related content can refer to corresponding parts in the above method.

Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be realized through computer programs to instruct related hardware, and the programs can be stored in a non-volatile computer-readable storage medium When the program is executed, it may include the processes of the embodiments of the above-mentioned methods. Wherein, any references to memory, storage, database or other media used in the various embodiments provided in the present application may include non-volatile and/or volatile memory. Nonvolatile memory can include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in many forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Chain Synchlink DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

The technical features of the above embodiments can be combined arbitrarily. To make the description concise, all possible combinations of the technical features in the above embodiments are not described. However, as long as there is no contradiction in the combination of these technical features, they should be It is considered to be within the range described in this specification.

The above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: it can still be described in the foregoing embodiments Modifications are made to the recorded technical solutions, or equivalent replacements are made to some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims (5)

1. A block chain network hierarchical transmission method based on multi-scale node management, characterized in that, comprising the following steps, S1. Set the scale division force n according to the scale of the entire blockchain network, that is, when the scale level Scale-level=1, the nodes in the network are divided into n intervals; when the number of nodes contained in each interval is less than or equal to the division When the intensity is n, it will not continue to divide new scales; S2. Initialize the neighbor node list; when a new node joins the network, according to its ID value, it is judged that the node is located in the interval of scale level Scale-level=1, and a node is randomly selected from the sibling intervals of this interval to join The neighbor node list of this new node; repeat this method, select the corresponding node at other scales, and add it to the neighbor node list; the sibling interval of the node is all subintervals of the interval of the previous scale of the interval to which the node belongs; S3, data sending; S4, data receiving and forwarding; Wherein, the initialization of the neighbor node list in the step S2 includes the following steps, Local nodes have unique intervals at different scales. The parent interval of a node is the interval of the previous scale of the interval to which the node belongs, the child interval of the node is the interval of the next scale of the interval to which the node belongs, and the sibling interval of the node is All sub-intervals of the interval of the previous scale of the interval to which the node belongs; each node is at different scales, in all brother intervals, if a node is selected as its neighbor node, then at each scale, each node has n neighbors Node, if the number of node ID digits is m, then there are a total of

neighbor nodes; When node a establishes a connection with another node c in the P2P network, node a determines the interval to which node c belongs under different scale levels according to the ID value of node c. When there is already a neighboring node b in this interval, then Node c is used as a backup node, and within the heartbeat cycle, node a compares the network response speed with node b and node c, if the network response speed with node c is greater than the network response speed with node b, replace node c with node b becomes the neighbor node of node a in the interval, otherwise, keep node b as the neighbor node of node a in the interval; The data sending in the step S3 includes the following steps. When the data sending node sends transactions and block data in the block chain system, the data is first packaged into a standard data format according to the block chain related protocol, and the transmission level data item is added at the same time. , at this time, the data is sent for the first time, so the transmission level value is 1; and according to the transmission level value 1, the scale level is also determined to be 1, and all the neighboring nodes of the data sending node under this scale level are selected, and the transmission level will be added The data of the node is sent to these neighboring nodes of the node; The data receiving and forwarding in S4 includes the following steps. First, verify the received data, verify the validity of the transaction and block data, and at the same time verify the transmission level data items. The minimum value is 1, and the maximum value does not exceed the maximum value. scale level; then verify the signature of the transmission level to judge the validity of the signature; after the received data is verified, the judgment of data forwarding will be carried out. Firstly, the value of the transmission level in the received data will be increased by 1 as the data forwarding neighbor node The selected scale level, first judge whether the scale level exceeds the maximum scale level of the blockchain system; judge whether there are adjacent nodes under this scale level, if there is no adjacent node, no longer forward data, if there is, send data to these adjacent nodes Nodes forward data. 2. The blockchain network hierarchical transmission method based on multi-scale node management according to claim 1, characterized in that: the step S1 includes the scale division step as follows: S11. Arrange all the nodes in the network according to the ID values from small to large, and determine the division strength n; S12. Set the scale level Scale-level=1, and divide the node set in the network into n intervals according to the degree of division, that is, interval 11, interval 12...interval 1n; S13. Set the scale level Scale-level=2, and divide the n intervals under the scale level 1 into n intervals respectively; S14. When the number of nodes contained in each interval is less than or equal to the division strength n, no longer continue to divide new scales; at this time, the scale level scale Scale-level=k, and n under the scale level k-1 The ^k-1 intervals are equally divided into n intervals; if the number of node IDs is m, the calculated maximum value of the system scale is

. 3. The blockchain network hierarchical transmission method based on multi-scale node management according to claim 2, characterized in that: the data reception and forwarding in the S4 also includes after the data forwarding, the next batch of nodes that receive the data, repeat The above data is received and forwarded until most nodes in the P2P network of the blockchain system have received the data. 4. The blockchain network hierarchical transmission method based on multi-scale node management according to claim 3, characterized in that: after the data in the S4 is received and forwarded, it also includes new node joining/node exit: The network status of each node is uncontrollable, and the network bandwidth of the nodes cannot be required, and they cannot even be required to be in a stable network. Nodes can be offline at any time, and new nodes can join at any time; When a new node joins, first calculate the ID value corresponding to the node, and then assign it to the corresponding interval through the interval divided by the blockchain node at the beginning, and then complete the entire block by updating the adjacent nodes update of the nodes of the chain; When a node is offline or exits due to some factors, when the system updates the adjacency points, it will re-allocate new adjacency points to those nodes with the exit node as the adjacency point. 5. A computer-readable storage medium storing a computer program, when the computer program is executed by a processor, the processor is made to perform the steps of the method according to any one of claims 1 to 4.

Images