CN111901254B - Bandwidth allocation method and device for all nodes, electronic equipment and storage medium - Google Patents

Abstract

The present application discloses a full-node bandwidth allocation method, device, electronic device and storage medium, which relate to the field of blockchain technology and can be used for cloud computing and cloud services. The specific implementation scheme is: determine the required bandwidth for processing the transaction processing request initiated by the lightweight node; if the remaining bandwidth of the local node is less than the required bandwidth, determine whether to allow the release of the local full node connected to the local node; if , the local full node is released, and the transaction processing request is processed based on the released bandwidth. It solves the problem that the bandwidth of full nodes cannot be dynamically allocated in the current blockchain network. It can dynamically adjust the bandwidth allocation ratio of full nodes, and allocate bandwidth reasonably to full nodes and lightweight nodes. It has achieved great flexibility and versatility. A good balance provides a new idea for dynamically allocating full-node bandwidth.

Description

Full-node bandwidth allocation method, device, electronic device and storage medium

technical field

The present application relates to the field of computer technology, in particular to blockchain technology, and in particular to a full-node bandwidth allocation method, device, electronic device, and storage medium.

Background technique

There are both lightweight nodes and full nodes in the blockchain network. Among them, full nodes are responsible for operations such as generating blocks, reaching consensus, synchronizing blocks, synchronizing transactions, and storing block ledgers, while lightweight nodes connect to the blockchain network by connecting full nodes, and mainly provide the creation and query of transaction processing requests. and so on.

The bandwidth of a full node is limited, and part of it is used to establish connections with other full nodes, and the other part is used to establish connections with lightweight nodes. Generally speaking, the number of lightweight nodes is much larger than the number of full nodes. Transaction processing requests originate from lightweight nodes. If requests from lightweight nodes are not processed in a timely manner, the user experience will be affected. However, full nodes play a more important role in the robustness, security and block generation stability of the entire blockchain network. So how to allocate bandwidth to ensure that the performance and security of the entire network are in the best state is crucial.

SUMMARY OF THE INVENTION

The present disclosure provides a full-node bandwidth allocation method, apparatus, electronic device, and storage medium, so as to reasonably allocate the full-node bandwidth.

According to an aspect of the present disclosure, there is provided a full-node bandwidth allocation method, the method comprising:

Determine the required bandwidth for processing transaction requests initiated by lightweight nodes;

In the case that the remaining bandwidth of the local node is less than the required bandwidth, determining whether to allow the release of the local full node connected to the local node;

If so, the local full node is released, and the transaction request is processed based on the released bandwidth.

According to another aspect of the present disclosure, a full-node bandwidth allocation apparatus is provided, the apparatus comprising:

The required bandwidth determination module is used to determine the required bandwidth for processing the transaction processing request initiated by the lightweight node;

A release determination module, configured to determine whether to allow the release of the local full node connected to the local node when the remaining bandwidth of the local node is less than the required bandwidth;

The release module is used to release the local full node if the local full node connected to the local node is allowed to be released;

A processing module, configured to process the transaction processing request based on the released bandwidth.

According to another aspect of the present disclosure, there is provided an electronic device comprising:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,

The memory stores instructions executable by the at least one processor, the instructions are executed by the at least one processor to enable the at least one processor to execute the full node according to any embodiment of the present application bandwidth allocation method.

According to another aspect of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to cause the computer to execute the full-node process described in any of the embodiments of the present application. Bandwidth allocation method.

The technology according to the present application solves the problem that the bandwidth of full nodes cannot be dynamically allocated in the current blockchain network, can dynamically adjust the bandwidth allocation ratio of full nodes, and reasonably allocate bandwidth to full nodes and lightweight nodes. A good balance has been achieved in versatility, providing a new idea for dynamically allocating full-node bandwidth.

It should be understood that what is described in this section is not intended to identify key or critical features of embodiments of the disclosure, nor is it intended to limit the scope of the disclosure. Other features of the present disclosure will become readily understood from the following description.

Description of drawings

The accompanying drawings are used to better understand the present solution, and do not constitute a limitation to the present application. in:

1 is a flowchart of a method for allocating bandwidth to a full node according to an embodiment of the present application;

2A is a flowchart of another full-node bandwidth allocation method provided according to an embodiment of the present application;

2B and 2C are schematic diagrams of a full-node bandwidth allocation node according to an embodiment of the present application;

FIG. 3 is a flowchart of yet another full-node bandwidth allocation method provided according to an embodiment of the present application;

4 is a schematic structural diagram of a device for allocating bandwidth for all nodes according to an embodiment of the present application;

FIG. 5 is a block diagram of an electronic device used to implement the bandwidth allocation method for a full node according to an embodiment of the present application.

Detailed ways

Exemplary embodiments of the present application are described below with reference to the accompanying drawings, which include various details of the embodiments of the present application to facilitate understanding, and should be considered as exemplary only. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present application. Also, descriptions of well-known functions and constructions are omitted from the following description for clarity and conciseness.

FIG. 1 is a flowchart of a method for allocating bandwidth to a full node according to an embodiment of the present application. The embodiments of the present application are applicable to the situation of how to dynamically allocate the bandwidth of a full node. The method can be performed by a bandwidth allocating apparatus of all nodes, which can be implemented in software and/or hardware, and can be integrated into a computing device carrying a blockchain node. As shown in FIG. 1 , the bandwidth allocation method for all nodes provided in this embodiment may include:

S101: Determine the required bandwidth for processing the transaction processing request initiated by the lightweight node.

It can be understood that any full node in the blockchain network can establish a communication connection with the lightweight node, and can process the transaction processing request initiated by the lightweight node. Requests can include query requests and on-chain requests. Optionally, according to the situation of the local node processing transaction processing requests, the lightweight nodes connected to the local node can be divided into two categories. The magnitude node is the lightweight node to be processed; the so-called lightweight node in processing is the initiator of the transaction processing request being processed by the local node, and the lightweight node to be processed is the one obtained by the local node. The originator of the pending transaction request. The lightweight node in this embodiment is the second type of lightweight node. Further, the number of lightweight nodes is at least one. It should be noted that, for the convenience of distinction, the first type of lightweight node and the second type of lightweight node will be used for description in this embodiment and subsequent embodiments.

In this embodiment, the required bandwidth is the required bandwidth for the local node to process the transaction processing request initiated by the second type of lightweight node.

Optionally, the local node may determine to process the transaction initiated by the second type of lightweight node according to the obtained number of transaction processing requests initiated by the second type of lightweight node, the type and complexity of the transaction processing request, etc. The required bandwidth to process the request.

S102, in the case that the remaining bandwidth of the local node is less than the required bandwidth, determine whether to allow the release of the local full node connected to the local node.

It can be understood that the local full node is the full node connected to the local node in the blockchain network. The local node needs to consume a certain amount of bandwidth to transmit blocks, transaction processing requests, etc. to the local full node connected to the local node. At the same time, the transaction processing request being processed locally by the local node also needs to consume a certain bandwidth of the local node (that is, the local node processes the first The transaction processing request initiated by the class lightweight node needs to consume the bandwidth of the local node); the remaining bandwidth of the local node is the remaining available bandwidth after deducting the consumed bandwidth from the total bandwidth of the local node.

Optionally, after determining the required bandwidth for processing the transaction processing request initiated by the second type of lightweight node, the local node may compare the remaining bandwidth of the local node with the required bandwidth; the remaining bandwidth of the local node is equal to or greater than the required bandwidth. In the case of bandwidth, the transaction processing request initiated by the second type of lightweight node can be directly processed; when the remaining bandwidth of the local node is less than the required bandwidth, it can be judged whether to allow the release of the local full node connected to the local node. , and then, according to the judgment result, it is determined whether to process the transaction processing request initiated by the second type of lightweight node.

Optionally, in the case that the remaining bandwidth of the local node is less than the required bandwidth, determining whether to allow the release of the local full node connected to the local node may include at least one of the following, specifically: 1) The remaining bandwidth of the local node is less than the required bandwidth bandwidth, and the remaining bandwidth of the local node is not enough to process a transaction request initiated by a second-type lightweight node, determine whether to allow the release of the local full node connected to the local node; 2) In the number of lightweight nodes If the remaining bandwidth of the local node is less than the required bandwidth, but the remaining bandwidth of the local node can satisfy the processing of transaction requests initiated by some second-type lightweight nodes, determine whether to release the connection with the local node. 3) The remaining bandwidth at the local node is less than the required bandwidth, and the first type of lightweight nodes connected to the local node are always in an active state (that is to say, the local node cannot release the first class connected to it at this time. In the case of a class lightweight node), determine whether to allow the release of the local full node connected to the local node, etc.

Exemplarily, when the local node determines that the remaining bandwidth of the local node is less than the required bandwidth, it can be based on the current block production speed of the blockchain network, the number of full nodes connected to the local node, and the number of unprocessed transaction requests, etc. , to determine whether to allow the release of the local full node connected to the local node. Further, the local node may also determine whether to allow the release of the local full node connected to the local node according to the general bandwidth allocation policy set in the local deployment data, which will be described in detail in subsequent embodiments.

S103, if yes, release the local full node, and process the transaction processing request based on the released bandwidth.

It is understandable that any full node in the blockchain network needs to be connected to at least one other full node, so it is only possible to allow release and local full nodes if the number of local full nodes connected to the local node is at least two. The local full node to which the node is connected.

Furthermore, after determining that the local node is allowed to release the local full node connected to the local node, it can select the full node to be released from the local full nodes connected to the local node, release the full node to be released, and then release the full node based on the bandwidth released by the full node. The transaction processing requests initiated by the second type of lightweight nodes are processed.

It should be noted that, in this embodiment, the local full node connected to the local node can be flexibly released to respond to the transaction processing request of the lightweight node in time, thereby improving the user experience. In the case of a local full node, the local full node is released, which ensures that the robustness, security and block generation stability of the entire blockchain network will not be affected by the full node, and has achieved good flexibility and versatility. balance.

In the technical solution of the embodiments of the present application, in the case where the local remaining bandwidth of the blockchain node is less than the required bandwidth for processing the transaction processing request initiated by the lightweight node, it is judged whether to allow the release of the local node connected to the blockchain node. The full node, and when it is determined that the release is allowed, the local full node is released flexibly, and then the transaction processing request is processed based on the bandwidth released by the released local full node. It solves the problem that the bandwidth of full nodes cannot be dynamically allocated in the current blockchain network. It can dynamically adjust the bandwidth allocation ratio of full nodes, and allocate bandwidth reasonably to full nodes and lightweight nodes. It has achieved great flexibility and versatility. A good balance provides a new idea for dynamically allocating full-node bandwidth.

FIG. 2A is a flowchart of another full-node bandwidth allocation method provided according to an embodiment of the present application. On the basis of the above-mentioned embodiments, the embodiments of the present application further explain the determination of whether to allow the release of the full node connected to the local node. As shown in FIG. 2A , the bandwidth allocation method for all nodes provided in this embodiment may include:

S201: Determine the required bandwidth for processing the transaction processing request initiated by the lightweight node.

S202, in the case that the remaining bandwidth of the local node is less than the required bandwidth, determine the current number of full nodes of the first type of network in the blockchain network.

In order to allocate the bandwidth of the full nodes more reasonably, this embodiment dynamically divides the full nodes in the blockchain network into two types. The first type of network full nodes can also be called ordinary full nodes, which can undertake Block tasks, block synchronization tasks, transaction processing request synchronization tasks, transaction processing request forwarding tasks, block forwarding tasks, and obtaining transaction processing requests (such as query requests, on-chain requests, etc.) from lightweight nodes, etc. The second type of network full nodes can also be called service-type full nodes, which are dedicated to connecting lightweight nodes. They may not undertake block generation tasks, block forwarding tasks, and transaction processing request synchronization tasks, but they can undertake transactions. Handle request forwarding tasks, obtain transaction processing requests from lightweight nodes, and undertake block synchronization tasks. Further, the first type of network full node can be transformed into the second type of network full node, and the second type of network full node can also be transformed into the first type of network full node.

At the same time, a general bandwidth allocation strategy can be set in the deployment data of the blockchain network (further system-level smart contracts or consensus mechanisms, etc.), and the general bandwidth allocation strategy can specify any full node in the blockchain network (including The bandwidth of the first type of network full node and the second type of network full node) can be reserved M% for processing transaction processing requests of lightweight nodes, and N% for connecting to other full nodes in the blockchain network. The sum of M% of the full-node bandwidth and N% of the full-node bandwidth may be equal to the full-node bandwidth. Further, the deployment data of the blockchain network (further system-level smart contracts or consensus mechanisms, etc.) can also set a lower limit of the first quantity and a lower limit of the second quantity, among which, the lower limit of the first quantity is the lower limit of the number of local full nodes connected to the local node, and the second lower limit of the number is the lower limit of the number of full nodes of the first type of network in the blockchain network.

Optionally, each full node in the blockchain network can allocate bandwidth according to a general bandwidth allocation policy. For example, the bandwidth reserved for the lightweight node by the local node can handle transaction processing requests of 3 lightweight nodes at most, and the local node is currently processing the transaction requests of 3 lightweight nodes (ie, the first type of lightweight nodes). For transaction processing requests, the remaining bandwidth of the local node can be the bandwidth reserved for lightweight nodes minus the bandwidth required to process transaction processing requests of 3 lightweight nodes (ie, the first type of lightweight nodes). The remaining bandwidth of the local node can be 0, or not enough to handle a transaction request initiated by a second-type lightweight node.

At this time, the local node can determine that the remaining bandwidth of the local node is less than the required bandwidth, and then can determine the current number of full nodes of the first type of network in the blockchain network according to the relevant information of all nodes in the active node list maintained locally. Among them, the current number of the first type of network full nodes is the current number of the first type of network full nodes in the blockchain network. Further, the local full node connected to the local node may include the first type of network full node, and may also include the second type of network full node.

S203, according to the current number of network full nodes of the first type, the number of local full nodes connected to the local node, the first number lower limit value and the second number lower limit value, determine whether to allow release of the local full nodes connected to the local node.

Specifically, after the local node determines the current number of full nodes of the first type of network in the blockchain network, it can determine the current number of full nodes of the first type of network, the number of local full nodes connected to the local node, and the number of full nodes set in the deployment data. A number lower limit value and a second number lower limit value, etc., determine whether to allow the release of the local full node connected to the local node. For example, the current number of full nodes in the first type of network may be compared with the second lower limit of the number, and the number of local full nodes connected to the local node may be compared with the first lower limit of the number, and then according to the comparison result, determine Whether to allow the release of the local full node connected to the local node.

Further, the local node may be the first type of network full node, or may be the second type of network full node, and when the local node is the first type of network full node, the condition for determining whether to allow the release of the local full node connected to the local node, It is different from the condition for determining whether to allow the release of the local full node connected to the local node when the local node is the second type of network full node.

Optionally, in the case where the local node is the first type of network full node, if the current number of the first type of network full node is greater than the lower limit of the second number, and the number of local full nodes connected to the local node is greater than the first number lower limit limit, the local full node connected to the local node is allowed to be released. For example, the current number of full nodes in the first type of network is 10, and the lower limit of the second number is 3. At this time, the current number of full nodes in the first type of network, 10, is greater than the lower limit of the second number of 3, indicating that the local node has the opportunity to send to the second Class network full-node transformation; if it is determined that the number of local full-nodes connected to the local node is greater than the first lower limit of the number, it means that the local node can release the local full-node connected to the local node and degrade to the second-type network full-node For example, the first type of network full node shown in FIG. 2B connected with the lightweight node is transformed into the second type of network full node shown in FIG. 2C. That is, the local node can reduce the bandwidth reserved for other full nodes in the blockchain network and increase the bandwidth reserved for lightweight nodes.

Further, a third critical value can also be set in the deployment data of the blockchain network (further system-level smart contracts or consensus mechanisms, etc.), where the third critical value is the number of local full nodes connected to the local node. critical value, and the third critical value of the number is greater than the lower limit of the first number; optional, the third critical value of the number is the boundary between the local node serving as the full node of the first type of network and the local node serving as the full node of the second type of network, Specifically, when the number of local full nodes connected to the local node is less than or equal to the third critical value, the local node is the second type of network full nodes; when the number of local full nodes connected to the local node is greater than the third critical number In the case of value, the local node is the first type of network full node.

Furthermore, if the current number of full nodes in the first type of network is greater than the lower limit of the second number, and the number of local full nodes connected to the local node is equal to the lower limit of the first number, it means that the local node has no releasable local full nodes at this time. And at this time, the local node is the second type of network full node, the local node can refuse to process the transaction processing request initiated by the second type of lightweight node, or wait for the transaction processing request in processing (that is, the first type of lightweight node After the transaction processing request) is processed, the unprocessed transaction processing request (that is, the transaction processing request initiated by the second type of lightweight node) is processed.

Exemplarily, in the case where the local node is the second type of network full node, if the current number of the first type of network full node is greater than the second lower limit value, the number of local full nodes connected to the local node is less than the third critical value. , but the number of local full nodes connected to the local node is greater than the first lower limit value, it means that the local node can release the local full nodes connected to the local node, and the maximum number that can be released is the number of local full nodes connected to the local node and the first The difference between the lower limit of a quantity.

For another example, in the case where the local node is the second type of network full node, if the current number of the first type of network full node is less than or equal to the second lower limit value, the number of local full nodes connected to the local node is less than the third critical number. value, but the number of local full nodes connected to the local node is greater than the first lower limit value, it means that the local node can release the local full nodes connected to the local node, and the maximum number that can be released is the number of local full nodes connected to the local node and The difference between the lower limit values of the first quantity.

It should be noted that, in the case where the local node is the full node of the second type of network, since the local node is already the full node of the second type of network at this time, it is also possible not to pay attention to the current number and the second number of full nodes of the first type of network. The relationship between the lower limit values.

For another example, in the case where the local node is the first type of network full node, if the current number of the first type of network full node is less than or equal to the lower limit of the second number, the local node may directly refuse to release the local full node connected to the local node. The node, that is, refuses to process the transaction processing request initiated by the second type of lightweight node, or waits for the transaction processing request of the first type of lightweight node to be processed before processing the transaction processing request of the second type of lightweight node. ; Or, the local node can determine whether the number of local full nodes connected to the local node is greater than the third critical value, and if so, it is allowed to release the local full nodes connected to the local node, and the maximum number that can be released is the number of local full nodes connected to the local node. The difference between the number of full nodes and the third threshold is subtracted by 1. If not, the local node may directly refuse to release the local full node connected to the local node. It is worth noting that in this case, even if the local node releases the local full node connected to it, it will not degenerate into the second type of network full node, so as to ensure that the robustness and security of the full node to the entire blockchain network are not affected. performance and block stability.

It should be noted that, in this embodiment, the first quantity lower limit value, the second quantity lower limit value and the third quantity threshold are set in the deployment data of the blockchain network (further system-level smart contracts or consensus mechanisms, etc.) It controls the conditions for the local node to release the local full node connected to it, avoiding the random release of the full node connected to it by the full node in the blockchain, resulting in the unstable operation of the blockchain network, and further ensuring the regional The block data in the blockchain has high security.

S204, if yes, release the local full node, and process the transaction processing request based on the released bandwidth.

The technical solutions of the embodiments of the present application control the conditions for all nodes in the blockchain network to release all nodes connected to them by introducing a first lower limit value and a second lower limit value, etc., so as to facilitate the release of all nodes. It manages and controls the full nodes connected to it, and can respond to the transaction processing requests of lightweight nodes in a timely manner, while ensuring the robustness, security and block generation stability of the entire blockchain network, providing dynamic allocation of full node bandwidth. A new way of thinking.

It can be understood that, in this embodiment, the first type of network full nodes can be converted to the second type of network full nodes, and the second type of network full nodes can also be converted to the first type of network full nodes. Optionally, if the local node is the second type of network full node, the local node can determine the recovery probability according to the current number of the first type of network full nodes and the lower limit of the second number; and according to the recovery probability, from the current second The network full node is transferred to the first network full node.

Optionally, the local node can determine the current number of full nodes of the first type of network in the blockchain network according to the relevant information of all nodes in the list of active nodes maintained locally; and can compare the current number of full nodes of the first type of network with the second number. The lower limit value is compared. If the current number of full nodes of the first type of network is less than the lower limit of the second number, the local node has the opportunity to recover (ie, be converted into) the full node of the first type of network.

Specifically, the local node can divide the current number of all nodes in the first type of network by the lower limit of the second number, and use 1 to subtract the quotient obtained by the division operation to obtain the recovery probability; The second type of network full node is transferred to the first type of network full node. Further, the greater the recovery probability, the greater the probability that the local node is transformed from the current second type of network full node to the first type of network full node.

It should be noted that by introducing the recovery probability, the second type of network full nodes can be transformed into the first type of network full nodes, which further increases the flexibility of the scheme.

FIG. 3 is a flowchart of yet another full-node bandwidth allocation method according to an embodiment of the present application. Based on the foregoing embodiments, the embodiments of the present application further explain the release of the local full node. As shown in FIG. 3 , the bandwidth allocation method for all nodes provided in this embodiment may include:

S301: Determine the required bandwidth for processing the transaction processing request initiated by the lightweight node.

S302, in the case that the remaining bandwidth of the local node is less than the required bandwidth, determine whether to allow the release of the local full node connected to the local node.

S303, if yes, determine the bandwidth to be released according to the required bandwidth and the remaining bandwidth of the local node.

Specifically, the required bandwidth can be subtracted from the remaining bandwidth of the local node to obtain the bandwidth to be released. In this embodiment, the bandwidth to be released is the bandwidth that needs to be released to process the transaction processing request initiated by the second type of lightweight node.

S304, according to the need to release the bandwidth, select the full node to be released from the local full nodes connected to the local node.

It can be understood that releasing a local full node can release the bandwidth used by the local node to transmit blocks and transmit transaction processing requests to the local full node.

Optionally, in this embodiment, the full node to be released may be selected from the local full nodes connected to the local node according to the bandwidth to be released and the maximum number of full nodes that can be released. Among them, if the local node is the second type of network full node, the maximum releaseable quantity is the difference between the number of local full nodes connected to the local node and the lower limit of the first quantity; if the local node is the first type of network full node, and The current number of full nodes in the first type of network is greater than the lower limit of the second quantity, and the maximum releaseable quantity is the difference between the number of local full nodes connected to the local node and the lower limit of the first number; nodes, and the current number of full nodes in the first type of network is less than or equal to the lower limit of the second number, then the maximum releaseable number is the difference between the number of local full nodes connected to the local node and the threshold of the third number minus 1.

Further, in this embodiment, the full node to be released may be selected from the local full nodes connected to the local node according to the required release bandwidth, the maximum amount that can be released, and the performance of the local full node. Among them, the performance of the local full node can be comprehensively measured by the hardware configuration of the local full node and the speed of data transmission from the local node to the local full node.

S305 , release all nodes to be released, and process the transaction processing request based on the released bandwidth.

Specifically, after the full node to be released is determined, the full node to be released can be released, and the transaction processing request initiated by the second type of lightweight node can be processed based on the released bandwidth.

Further, if the releasable bandwidth of the full node to be released is equal to or greater than the bandwidth to be released, the transaction processing request initiated by the second type of lightweight nodes can be directly processed, and there is no need to pay attention to the number of lightweight nodes at this time.

As an optional method of this embodiment of the present application, when the number of lightweight nodes (that is, the second type of lightweight nodes) is at least two, if the releasable bandwidth of the full node to be released is less than the bandwidth to be released , then according to the reception time of the transaction request and/or the activity of the lightweight node (ie, the second type of lightweight node), from the lightweight node that initiated the transaction request (ie the second type of lightweight node ), select a node that can process lightweight nodes, and process transaction processing requests that can process lightweight nodes. In this embodiment, the activity of the second lightweight node may be determined according to the historical connection record of the second lightweight node.

It should be noted that, in this embodiment, by comparing the releasable bandwidth with the required releasable bandwidth, when the releasable bandwidth is less than the required releasable bandwidth, and the number of the second type of lightweight nodes is multiple, the receiving time and active According to factors such as degree, select from multiple second-class lightweight nodes that can handle lightweight nodes, which further improves the user experience and increases the flexibility of the solution.

In the technical solution of the embodiment of the present application, when the blockchain node determines that the local full node connected to it is allowed to be released, the full node to be released is selected from the local full nodes connected to the blockchain node by introducing the bandwidth to be released, Release, which provides an optional way to release full nodes. At the same time, the full nodes to be released are selected based on the bandwidth to be released, which can also ensure that the bandwidth of the blockchain nodes can be fully utilized.

FIG. 4 is a schematic structural diagram of a device for allocating bandwidth for all nodes according to an embodiment of the present application. The device can implement the bandwidth allocation method for all nodes described in the embodiments of the present application. The device can be integrated into a computing device that carries full nodes in a blockchain network. The full-node bandwidth allocation device 400 specifically includes:

The required bandwidth determination module 401 is used for determining the required bandwidth for processing the transaction processing request initiated by the lightweight node;

The release determination module 402 is used to determine whether to allow the release of the local full node connected to the local node when the remaining bandwidth of the local node is less than the required bandwidth;

The release module 403 is used to release the local full node if the local full node connected to the local node is allowed to be released;

The processing module 404 is configured to process the transaction processing request based on the released bandwidth.

In the technical solution of the embodiments of the present application, in the case where the local remaining bandwidth of the blockchain node is less than the required bandwidth for processing the transaction processing request initiated by the lightweight node, it is judged whether to allow the release of the local node connected to the blockchain node. The full node, and when it is determined that the release is allowed, the local full node is released flexibly, and then the transaction processing request is processed based on the bandwidth released by the released local full node. It solves the problem that the bandwidth of full nodes cannot be dynamically allocated in the current blockchain network. It can dynamically adjust the bandwidth allocation ratio of full nodes, and allocate bandwidth reasonably to full nodes and lightweight nodes. It has achieved great flexibility and versatility. A good balance provides a new idea for dynamically allocating full-node bandwidth.

Exemplarily, the release determination module 402 includes:

The current quantity determination unit is used to determine the current quantity of the first type of network full nodes in the blockchain network;

The release determination unit is configured to determine whether to allow the release of local nodes connected to the local node according to the current number of network full nodes of the first type, the number of local full nodes connected to the local node, the lower limit of the first number and the lower limit of the second number. Full nodes; wherein, the first lower limit of the number is the lower limit of the number of local full nodes connected to the local node, and the second lower limit of the number is the lower limit of the number of the first type of network full nodes in the blockchain network.

Exemplarily, if the local node is a full node of the first type of network, the release determination unit is specifically used for:

If the current number of network full nodes of the first type is greater than the second lower limit value, and the number of local full nodes is greater than the first number lower limit value, the local full nodes connected to the local node are allowed to be released.

Exemplarily, if the local node is a full node of the first type of network, the release determination unit is further specifically used for:

If the current number of full nodes in the first type of network is less than or equal to the second lower limit value, and the number of local full nodes is greater than the third critical value, the local full nodes connected to the local nodes are allowed to be released; wherein, the third critical value is the threshold for the number of local full nodes connected to the local node.

Exemplarily, if the local node is the second type of network full node, the release determination unit is specifically used for:

If the current number of network full nodes of the first type is greater than the second number lower limit value, the local full node number is less than the third number threshold value, and the local full node number is greater than the first number lower limit value, then the local nodes connected to the local nodes are allowed to be released. Full nodes; wherein, the third critical value is the critical value of the number of local full nodes connected to the local node.

Exemplarily, the release module 403 is specifically used for:

Determine the bandwidth to be released according to the required bandwidth and the remaining bandwidth of the local node;

To release bandwidth as needed, select the full node to be released from the local full nodes connected to the local node;

Release the full node to be released.

Exemplarily, if the number of lightweight nodes is at least two, the processing module 404 is specifically configured to:

If the releasable bandwidth of the full node to be released is less than the bandwidth to be released, select the light-weight node that can process the transaction request from the light-weight nodes that initiate the transaction request according to the reception time of the transaction request and/or the activity of the light-weight node node;

Handles transaction processing requests that can handle lightweight nodes.

Exemplarily, if the local node is a full node of the second type of network, the above-mentioned apparatus further includes:

a probability determination module, configured to determine the recovery probability according to the current number of full nodes in the first type of network and the lower limit of the second number;

The transformation module is used to transform the current second-type network full node into the first-type network full node according to the recovery probability.

Exemplarily, the first type of network full nodes undertake the task of producing blocks, and the second type of network full nodes do not undertake the task of producing blocks.

According to the embodiments of the present application, the present application further provides an electronic device and a readable storage medium.

As shown in FIG. 5 , it is a block diagram of an electronic device of a bandwidth allocation method for a full node according to an embodiment of the present application. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. Electronic devices may also represent various forms of mobile devices, such as personal digital processors, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are by way of example only, and are not intended to limit implementations of the application described and/or claimed herein.

As shown in FIG. 5, the electronic device includes: one or more processors 501, a memory 502, and interfaces for connecting various components, including a high-speed interface and a low-speed interface. The various components are interconnected using different buses and may be mounted on a common motherboard or otherwise as desired. The processor may process instructions executed within the electronic device, including instructions stored in or on memory to display graphical information of the GUI on an external input/output device, such as a display device coupled to the interface. In other embodiments, multiple processors and/or multiple buses may be used with multiple memories and multiple memories, if desired. Likewise, multiple electronic devices may be connected, each providing some of the necessary operations (eg, as a server array, a group of blade servers, or a multiprocessor system). A processor 501 is taken as an example in FIG. 5 .

The memory 502 is the non-transitory computer-readable storage medium provided by the present application. Wherein, the memory stores instructions executable by at least one processor, so that the at least one processor executes the full-node bandwidth allocation method provided by the present application. The non-transitory computer-readable storage medium of the present application stores computer instructions, and the computer instructions are used to cause the computer to execute the bandwidth allocation method for a full node provided by the present application.

As a non-transitory computer-readable storage medium, the memory 502 can be used to store non-transitory software programs, non-transitory computer-executable programs and modules, such as program instructions/modules ( For example, the demand bandwidth determination module 401, the release determination module 402, the release module 403 and the processing module 404 shown in FIG. 4). The processor 501 executes various functional applications and data processing of the server by running the non-transitory software programs, instructions and modules stored in the memory 502, ie, implements the bandwidth allocation method for all nodes in the above method embodiments.

The memory 502 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required by at least one function; the storage data area may store a storage data area created according to the use of the electronic device of the full node bandwidth allocation method. data etc. Additionally, memory 502 may include high-speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, memory 502 may optionally include memory located remotely relative to processor 501, and these remote memories may be connected to electronic devices of the full-node bandwidth allocation method via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, blockchain networks, mobile communication networks, and combinations thereof.

The electronic device for the full-node bandwidth allocation method may further include: an input device 503 and an output device 504 . The processor 501 , the memory 502 , the input device 503 and the output device 504 may be connected by a bus or in other ways, and the connection by a bus is taken as an example in FIG. 5 .

The input device 503 can receive input numerical or character information, and generate key signal input related to user settings and function control of the electronic equipment of the full-node bandwidth allocation method, such as a touch screen, a keypad, a mouse, a trackpad, a touchpad, An input device such as a pointing stick, one or more mouse buttons, trackball, joystick, etc. Output devices 504 may include display devices, auxiliary lighting devices (eg, LEDs), haptic feedback devices (eg, vibration motors), and the like. The display device may include, but is not limited to, a liquid crystal display (LCD), a light emitting diode (LED) display, and a plasma display. In some implementations, the display device may be a touch screen.

Various implementations of the systems and techniques described herein can be implemented in digital electronic circuitry, integrated circuit systems, application specific ASICs (application specific integrated circuits), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include being implemented in one or more computer programs executable and/or interpretable on a programmable system including at least one programmable processor that The processor, which may be a special purpose or general-purpose programmable processor, may receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device an output device.

These computational programs (also referred to as programs, software, software applications, or codes) include machine instructions for programmable processors, and may be implemented using high-level procedural and/or object-oriented programming languages, and/or assembly/machine languages calculation program. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and/or apparatus for providing machine instructions and/or data to a programmable processor ( For example, magnetic disks, optical disks, memories, programmable logic devices (PLDs), including machine-readable media that receive machine instructions as machine-readable signals. The term "machine-readable signal" refers to any signal used to provide machine instructions and/or data to a programmable processor.

To provide interaction with a user, the systems and techniques described herein may be implemented on a computer having: a display device (eg, a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user ); and a keyboard and pointing device (eg, a mouse or trackball) through which a user can provide input to the computer. Other kinds of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (eg, visual feedback, auditory feedback, or tactile feedback); and can be in any form (including acoustic input, voice input, or tactile input) to receive input from the user.

The systems and techniques described herein can be implemented on a computing system that includes back-end components (eg, as a data server), or a computing system that includes middleware components (eg, an application server), or a computing system that includes front-end components (eg, a user computer having a graphical user interface or web browser through which a user can interact with implementations of the systems and techniques described herein), or including such backend components, middleware components, Or any combination of front-end components in a computing system. The components of the system may be interconnected by any form or medium of digital data communication (eg, a communication network). Examples of communication networks include: Local Area Networks (LANs), Wide Area Networks (WANs), the Internet, and blockchain networks.

A computer system can include clients and servers. Clients and servers are generally remote from each other and usually interact through a communication network. The relationship of client and server arises by computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also known as a cloud computing server or a cloud host. It is a host product in the cloud computing service system to solve the traditional physical host and VPS services, which are difficult to manage and weak in business scalability. defect.

According to the technical solutions of the embodiments of the present application, in the case where the local remaining bandwidth of the blockchain node is less than the required bandwidth for processing the transaction processing request initiated by the lightweight node, it is determined whether to allow the release of the blockchain node connected to the blockchain node. The local full node, and if it is determined that the release is allowed, the local full node is flexibly released, and then the transaction processing request is processed based on the bandwidth released by the released local full node. It solves the problem that the bandwidth of full nodes cannot be dynamically allocated in the current blockchain network. It can dynamically adjust the bandwidth allocation ratio of full nodes, and allocate bandwidth reasonably to full nodes and lightweight nodes. It has achieved great flexibility and versatility. A good balance provides a new idea for dynamically allocating full-node bandwidth.

It should be understood that steps may be reordered, added or deleted using the various forms of flow shown above. For example, the steps described in the present application can be performed in parallel, sequentially or in different orders, and as long as the desired results of the technical solutions disclosed in the present application can be achieved, no limitation is imposed herein.

The above-mentioned specific embodiments do not constitute a limitation on the protection scope of the present application. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modifications, equivalent replacements and improvements made within the spirit and principles of this application shall be included within the protection scope of this application.

Claims (18)

1. A bandwidth allocation method of a full node comprises the following steps:

determining the required bandwidth for processing a transaction processing request initiated by a lightweight node;

determining whether to allow release of a local full node connected with the local node under the condition that the residual bandwidth of the local node is smaller than the required bandwidth;

and if so, releasing the local full node, and processing the transaction processing request based on the released bandwidth.

2. The method of claim 1, wherein determining whether to allow release of the local full node connected to the local node comprises:

determining the current number of the first type of network full nodes in the block chain network; the first type network full node undertakes a block task, a transaction request synchronization task and a block forwarding task;

determining whether to allow the release of the local full nodes connected with the local nodes according to the current number of the first type network full nodes, the number of the local full nodes connected with the local nodes, a first number lower limit value and a second number lower limit value; the first lower limit value of the number is a lower limit value of the number of local full nodes connected with the local nodes, and the second lower limit value of the number is a lower limit value of the number of first type network full nodes in the block chain network.

3. The method of claim 2, wherein if the local node is a first type network full node, determining whether to allow the release of the local full node connected to the local node according to the current number of the first type network full nodes, the number of local full nodes connected to the local node, a first number lower limit value and a second number lower limit value comprises:

and if the current number of the first type of network full nodes is greater than the second number lower limit value and the number of the local full nodes is greater than the first number lower limit value, allowing the local full nodes connected with the local nodes to be released.

4. The method of claim 2, wherein if the local node is a first type network full node, determining whether to allow the release of the local full node connected to the local node according to the current number of the first type network full nodes, the number of local full nodes connected to the local node, a first number lower limit value and a second number lower limit value comprises:

if the current number of the first type network full nodes is less than or equal to the second number lower limit value and the number of the local full nodes is greater than a third number critical value, allowing the local full nodes connected with the local nodes to be released; the third quantity critical value is a local full-node quantity critical value connected with the local node, and is a boundary line between the local node as a first-class network full node and the local node as a second-class network full node, and the third quantity critical value is greater than the first quantity lower limit value; the second type network whole nodes do not undertake the block task, the transaction request synchronization task and the block forwarding task.

5. The method of claim 2, wherein if the local node is a second type of network full node, determining whether to allow the release of the local full node connected to the local node according to the current number of the first type of network full nodes, the number of local full nodes connected to the local node, a first number lower limit value and a second number lower limit value comprises:

if the current number of the first type network full nodes is larger than the second number lower limit value, the number of the local full nodes is smaller than a third number critical value, and the number of the local full nodes is larger than the first number lower limit value, the local full nodes connected with the local nodes are allowed to be released; the third quantity critical value is a local full-node quantity critical value connected with the local node, and is a boundary line between the local node as a first-class network full node and the local node as a second-class network full node, and the third quantity critical value is greater than the first quantity lower limit value; the second type network whole nodes do not undertake the block task, the transaction request synchronization task and the block forwarding task.

6. The method of claim 1, wherein releasing the local full node comprises:

determining the bandwidth to be released according to the required bandwidth and the residual bandwidth of the local node;

selecting a full node to be released from the local full nodes connected with the local node according to the bandwidth to be released;

and releasing the full node to be released.

7. The method of claim 6, wherein if the number of lightweight nodes is at least two, processing the transaction request based on the released bandwidth comprises:

if the releasable bandwidth of the full node to be released is smaller than the bandwidth to be released, selecting a processable lightweight node from the lightweight nodes initiating the transaction processing request according to the receiving time of the transaction processing request and/or the activity of the lightweight nodes;

and processing the transaction processing request of the processable lightweight node.

8. The method of claim 2, if the local node is a second type of network full node, the method further comprising:

determining the recovery probability according to the current number of the first type of network full nodes and the lower limit value of the second number;

and converting the current second type network full node into the first type network full node according to the recovery probability.

9. A full-node bandwidth allocation apparatus, comprising:

the demand bandwidth determining module is used for determining the demand bandwidth for processing the transaction processing request initiated by the lightweight node;

a release determining module, configured to determine whether to allow release of a local full node connected to a local node when a remaining bandwidth of the local node is smaller than the required bandwidth;

the release module is used for releasing the local full node if the release of the local full node connected with the local node is allowed;

and the processing module is used for processing the transaction processing request based on the released bandwidth.

10. The apparatus of claim 9, wherein the release determination module comprises:

a current number determination unit, configured to determine a current number of all nodes of a first type network in a blockchain network; the first type network full node undertakes a block task, a transaction request synchronization task and a block forwarding task;

a release determining unit, configured to determine whether to allow release of the local full node connected to the local node according to the current number of the first-class network full nodes, the number of the local full nodes connected to the local node, a first number lower limit value, and a second number lower limit value; the first lower limit value of the number is a lower limit value of the number of local full nodes connected with the local nodes, and the second lower limit value of the number is a lower limit value of the number of first type network full nodes in the block chain network.

11. The apparatus according to claim 10, wherein if the local node is a first-class network full node, the release determining unit is specifically configured to:

and if the current number of the first type of network full nodes is greater than the second number lower limit value and the number of the local full nodes is greater than the first number lower limit value, allowing the local full nodes connected with the local nodes to be released.

12. The apparatus according to claim 10, wherein if the local node is a first-class network full node, the release determining unit is further specifically configured to:

if the current number of the first type network full nodes is less than or equal to the second number lower limit value and the number of the local full nodes is greater than a third number critical value, allowing the local full nodes connected with the local nodes to be released; the third quantity critical value is a local full-node quantity critical value connected with the local node, and is a boundary line between the local node as a first-class network full node and the local node as a second-class network full node, and the third quantity critical value is greater than the first quantity lower limit value; the second type network whole nodes do not undertake the block task, the transaction request synchronization task and the block forwarding task.

13. The apparatus according to claim 10, wherein if the local node is a second-class network full node, the release determining unit is specifically configured to:

if the current number of the first type network full nodes is larger than the second number lower limit value, the number of the local full nodes is smaller than a third number critical value, and the number of the local full nodes is larger than the first number lower limit value, the local full nodes connected with the local nodes are allowed to be released; the third quantity critical value is a local full-node quantity critical value connected with the local node, and is a boundary line between the local node as a first-class network full node and the local node as a second-class network full node, and the third quantity critical value is greater than the first quantity lower limit value; the second type network whole nodes do not undertake the block task, the transaction request synchronization task and the block forwarding task.

14. The apparatus according to claim 9, wherein the release module is specifically configured to:

determining the bandwidth to be released according to the required bandwidth and the residual bandwidth of the local node;

selecting a full node to be released from the local full nodes connected with the local node according to the bandwidth to be released;

and releasing the full node to be released.

15. The apparatus according to claim 14, wherein if the number of lightweight nodes is at least two, the processing module is specifically configured to:

if the releasable bandwidth of the full node to be released is smaller than the bandwidth to be released, selecting a processable lightweight node from the lightweight nodes initiating the transaction processing request according to the receiving time of the transaction processing request and/or the activity of the lightweight nodes;

and processing the transaction processing request of the processable lightweight node.

16. The apparatus of claim 10, if the local node is a second type network full node, the apparatus further comprising:

a probability determination module, configured to determine a recovery probability according to the current number of the first class of network full nodes and the lower limit value of the second number;

and the conversion module is used for converting the current second type network full node into the first type network full node according to the recovery probability.

17. An electronic device, comprising:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of full-node bandwidth allocation of any one of claims 1-8.

18. A non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the full-node bandwidth allocation method of any one of claims 1-8.

Images