CN112564960A - Elastic adjustment consensus method and device based on block link point centrality - Google Patents

Elastic adjustment consensus method and device based on block link point centrality Download PDF

Info

Publication number
CN112564960A
CN112564960A CN202011386575.3A CN202011386575A CN112564960A CN 112564960 A CN112564960 A CN 112564960A CN 202011386575 A CN202011386575 A CN 202011386575A CN 112564960 A CN112564960 A CN 112564960A
Authority
CN
China
Prior art keywords
consensus
nodes
module
node
consensus algorithm
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202011386575.3A
Other languages
Chinese (zh)
Other versions
CN112564960B (en
Inventor
臧铖
陈嘉俊
张敬之
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Yiqiyin Hangzhou Technology Co Ltd
China Zheshang Bank Co Ltd
Original Assignee
China Zheshang Bank Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Zheshang Bank Co Ltd filed Critical China Zheshang Bank Co Ltd
Priority to CN202011386575.3A priority Critical patent/CN112564960B/en
Publication of CN112564960A publication Critical patent/CN112564960A/en
Application granted granted Critical
Publication of CN112564960B publication Critical patent/CN112564960B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/142—Network analysis or design using statistical or mathematical methods
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network

Abstract

The invention discloses a block link point centrality elastic adjustment consensus-based method and a block link point centrality elastic adjustment consensus-based device, wherein the method is realized based on a CFT (computational fluid dynamics) and BFT (bidirectional Forwarding) mixed consensus, and the method comprises the following steps: calculating the number of nodes which can be directly connected with a certain node in the block chain network; judging whether the number of the direct-connected nodes exceeds a threshold value, if so, starting BFT consensus by the block chain network, and otherwise, starting CFT consensus; in the BFT consensus process, when a wrong node occurs, calculating the intermediary centrality of the wrong node, if the intermediary centrality exceeds a threshold value, switching to the CFT consensus, otherwise, not switching. The invention actively switches the Byzantine fault-tolerant consensus algorithm or the downtime fault-tolerant consensus algorithm by calculating the intermediate centrality of the blockchain network, thereby ensuring the normal operation of the blockchain system.

Description

Elastic adjustment consensus method and device based on block link point centrality
Technical Field
The invention relates to the field of block chains and consensus algorithms, in particular to a method and a device for elastically adjusting consensus based on the centrality of block chain link points.
Background
In the implementation and deployment process of an actual enterprise-level block chain network, the full-network message broadcasting is needed to ensure Byzantine fault tolerance, in order to simplify the network deployment cost, part of nodes play the role of central nodes, and in order to tolerate the situation that the central nodes have errors, only a consensus algorithm with low consensus strength can be adopted.
Disclosure of Invention
In order to solve the problems, the invention provides a method and a device for elastically adjusting consensus based on the centrality of block chain link points.
The purpose of the invention is realized by the following technical scheme:
according to a first aspect of the present description, there is provided a method for elastically adjusting consensus based on centrality of a block link point, the method being implemented based on a mixed consensus of a CFT module and a BFT module; the CFT module provides a downtime fault-tolerant consensus algorithm, and the BFT module provides a Byzantine fault-tolerant consensus algorithm; the method comprises the following steps:
calculating the number C of nodes which the ith node can be directly connected in the blockchain networki；
Judging whether the number of the direct-connected nodes exceeds a threshold value:
if it is
Figure BDA0002809856770000011
Block chain network starts BFT module, fault tolerance number at this time
Figure BDA0002809856770000012
If it is
Figure BDA0002809856770000013
Block chain network starts CFT module, fault tolerance number at this moment
Figure BDA0002809856770000014
During the execution of the BFT module, when an error node occurs, calculating the medium centrality SV of the error node vv(v (g), v), the calculation formula is as follows:
Figure BDA0002809856770000021
wherein G is the current network topological graph, and V (G) is the set of all nodes in the topological graph G;
Figure BDA0002809856770000022
is a binomial random variable, which indicates whether the node v positively contributes to the path p;
Figure BDA0002809856770000023
the two-term random variable represents whether the node v negatively contributes to the path p;
Figure BDA0002809856770000024
is a set of shortest paths between nodes s, t passing through node v; sigmastThe number of shortest paths between nodes s, t; Ψ (p) is the set of all nodes on path p;
judging whether the intermediary centrality exceeds a threshold value:
if it is
Figure BDA0002809856770000025
If the block chain network does not meet the Byzantine fault tolerance requirement, switching to the CFT module;
if it is
Figure BDA0002809856770000026
The blockchain network meets the Byzantine fault tolerance requirement without switching the consensus algorithm.
Further, the activity of the CFT module requires: q is less than or equal to N-f, wherein Q is the number of legal nodes, N is the number of all nodes, f is the number of nodes with possible errors, and the CFT module is a downtime error node; the safety requirement is as follows: any two sets of legal nodes should be able to intersect one or more block link points, thus requiring 2Q-N > 0.
Further, the activity of the BFT module requires: q + f is less than or equal to N, wherein Q is the number of legal nodes, N is the number of all nodes, f is the number of nodes with possible errors, and aiming at the BFT module, a downtime error node and a Byzantine error node possibly exist at the same time; the safety requirement is as follows: the intersection of the legal node sets in the two-two consensus phase must at least contain S honest nodes, and the number of honest nodes should be greater than the number of wrong nodes, i.e., S > f, and is equivalent to 2Q-N > f.
Furthermore, the proportion of network traffic occupied by a certain node is reflected by the intermediary centrality, and the influence of the node position and the networking structure thereof on the stability of the whole network is comprehensively considered by the intermediary centrality.
Further, when a switch from the BFT module to the CFT module is required, the following steps are performed:
the master node in the block chain network locks the consensus process, and at the moment, the master node refuses all messages to perform consensus;
the master node sends a consensus algorithm switching message to all the slave nodes;
after receiving the consensus algorithm switching message, each slave node broadcasts the reply message in the whole network;
when a node receives a message from at least
Figure BDA0002809856770000031
The reply message of each node is switched by a consensus algorithm;
when at least
Figure BDA0002809856770000032
After the nodes complete the switching of the consensus algorithm, the new consensus algorithm takes effect to replace the old consensus algorithm.
According to a second aspect of the present specification, there is provided an apparatus for elastically adjusting consensus based on centrality of a block link point, the apparatus comprising: the device comprises a CFT + BFT mixed type consensus device, a consensus algorithm starting module, a consensus algorithm switching judgment module and a consensus algorithm switching execution module;
the CFT + BFT mixed type consensus device comprises a CFT module and a BFT module; the CFT module provides a downtime fault tolerance consensus algorithm; the BFT module provides a Byzantine fault-tolerant consensus algorithm;
the consensus algorithm starting module: calculating the number C of nodes which the ith node can be directly connected in the blockchain networki(ii) a If it is
Figure BDA0002809856770000033
N is the number of all nodes, the BFT module is started, and the fault-tolerant number is obtained at the moment
Figure BDA0002809856770000034
If it is
Figure BDA0002809856770000035
Starting CFT module, fault tolerance number
Figure BDA0002809856770000036
The consensus algorithm switching judgment module: in the execution process of the BFT module, when an error node occurs, calculating the medium centrality SV of the error node vv(V (G), v), if
Figure BDA0002809856770000037
Switching to the CFT module; if it is
Figure BDA0002809856770000038
The consensus algorithm is not switched; SVv(V (G), v) and beta are calculated according to the following formula:
Figure BDA0002809856770000039
Figure BDA00028098567700000310
wherein G is the current network topological graph, and V (G) is the set of all nodes in the topological graph G;
Figure BDA00028098567700000311
is a binomial random variable, which indicates whether the node v positively contributes to the path p;
Figure BDA00028098567700000312
is a binomial random variable, representing whether node v negatively contributes to path p；
Figure BDA00028098567700000313
Is a set of shortest paths between nodes s, t passing through node v; sigmastThe number of shortest paths between nodes s, t; Ψ (p) is the set of all nodes on path p;
the consensus algorithm switching execution module: a master node locking consensus process; the master node sends a consensus algorithm switching message to all the slave nodes; after receiving the consensus algorithm switching message, each slave node broadcasts the reply message in the whole network; when a node receives a message from at least
Figure BDA0002809856770000041
The reply message of each node is switched by a consensus algorithm; when at least
Figure BDA0002809856770000042
After the nodes complete the switching of the consensus algorithm, the new consensus algorithm takes effect to replace the old consensus algorithm.
According to a third aspect of the present specification, there is provided a computer apparatus comprising a memory and a processor, the memory having stored therein computer-readable instructions which, when executed by the processor, cause the processor to perform the steps of the above method for elastic adjustment consensus based on block link point centrality.
According to a fourth aspect of the present description, there is provided a storage medium storing computer-readable instructions which, when executed by one or more processors, cause the one or more processors to perform the steps of the above method for elastic adjustment consensus based on block link point centrality.
The invention has the beneficial effects that: the invention provides a method and a device for elastically adjusting consensus based on the centrality of block chain link points, which creates an intermediary centrality concept, actively switches a Byzantine fault-tolerant consensus algorithm or a downtime fault-tolerant consensus algorithm by calculating the intermediary centrality of a block chain network, and ensures the normal operation of a block chain system.
Drawings
FIG. 1 is a flowchart of a method for elastic adjustment consensus based on the centrality of block link points according to an embodiment of the present invention;
fig. 2 is a flow chart of switching of consensus algorithms according to an embodiment of the present invention.
Detailed Description
For better understanding of the technical solutions of the present application, the following detailed descriptions of the embodiments of the present application are provided with reference to the accompanying drawings.
It should be understood that the embodiments described are only a few embodiments of the present application, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The terminology used in the embodiments of the present application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in the examples of this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
Fig. 1 is a flowchart of a method for elastically adjusting consensus based on centrality of a link point of a block according to an embodiment of the present invention, the method being implemented based on a hybrid consensus of a CFT module and a BFT module;
and the CFT module provides a downtime fault-tolerant consensus algorithm, and in order to meet the safety and activity of the block chain network, the CFT module requires:
activity (Liveness): all legal nodes (Quorum) are required to be available, so that the condition that Q is less than or equal to N-f is met, wherein Q is the number of the legal nodes, N is the number of all nodes, f is the number of nodes with errors possibly occurring, and the CFT module is a downtime error node;
safety (Safety): any two sets of legal nodes should be able to intersect with one or more block chain link points, a requirement also known as the majority principle property, and therefore requires 2Q-N > 0.
The BFT module provides a Byzantine fault-tolerant consensus algorithm, and the BFT module requires:
activity (Liveness): requiring Q + f to be less than or equal to N, wherein Q is the number of legal nodes, N is the number of all nodes, f is the number of nodes with possible errors, and aiming at the fact that a BFT module can simultaneously have a downtime error node and a Byzantine error node;
safety (Safety): the intersection of the legal node sets in the two-two consensus phase must at least contain S honest nodes, and the number of honest nodes should be greater than the number of wrong nodes, i.e., S > f, and is equivalent to 2Q-N > f.
In this embodiment, the method for elastically adjusting consensus based on the centrality of the block link points includes the following steps:
s1: calculating the number of nodes which can be directly connected with the ith node in the block chain network and recording as Ci。
S2: judging whether the number of the direct-connected nodes exceeds a threshold value:
s201: if it is
Figure BDA0002809856770000051
Block chain network starts BFT module, fault tolerance number at this time
Figure BDA0002809856770000052
S202: if it is
Figure BDA0002809856770000053
The BFT fault tolerance cannot be guaranteed, the block chain network starts the CFT module, and the fault tolerance number is at the moment
Figure BDA0002809856770000054
S3: in the execution process of the BFT module, when an error node occurs, calculating the medium centrality of the error node v, and recording the medium centrality as SVv(V (G), v), and judging whether the intermediary centrality exceeds a threshold value.
The invention reflects the proportion of network flow occupied by a certain node through the intermediary degree.
The existing Shapley value reflects a profit allocation model of allied members, reflects the contribution degree of each allied member to the total target of the alliance, avoids average sense of allocation, has more rationality and fairness compared with any allocation mode which only combines the resource input value and the resource allocation efficiency, and also reflects the process of mutual game of the allied members. The Shapley value is calculated as follows:
Figure BDA0002809856770000061
where A is the set of all nodes in the blockchain network, aiIs the ith node, v is a specific node in the topological graph, pi e pi (A) is a permutation and combination of nodes, PπIs defined as follows, Pπ(i)＝{ajIs e pi (j) < pi (i) }, wherein pi (i) is aiThe position of the node in pi.
On the basis of the above, the calculation formula of the intermediate centrality is as follows:
Figure BDA0002809856770000062
wherein G is a current network topological graph and is a fixed point set of the current topological graph, and V (G) is a set of all nodes in the topological graph G;
Figure BDA0002809856770000063
is a binomial random variable, which indicates whether the node v positively contributes to the path p;
Figure BDA0002809856770000064
the two-term random variable represents whether the node v negatively contributes to the path p;
Figure BDA0002809856770000065
is a set of shortest paths between nodes s, t passing through node v; sigmastThe number of shortest paths between nodes s, t; Ψ (p) is the set of all nodes on path p;
the influence of the node position and the networking structure on the stability of the whole network is comprehensively considered by the intermediary centrality.
In the networking process, the intermediary centrality of the nodes is required not to exceed a certain threshold, otherwise, the fault tolerance and stability of the network are affected:
Figure BDA0002809856770000066
where beta needs to be adjusted according to the network deployment conditions,
Figure BDA0002809856770000067
s301: if it is
Figure BDA0002809856770000068
The blockchain network does not meet the Byzantine fault tolerance requirement, and the algorithm is switched to CFT type consensus, namely switched to the CFT module.
S302: if it is
Figure BDA0002809856770000071
The blockchain network meets the byzantine fault tolerance requirement and the algorithm does not need to be switched.
In the embodiment of the present invention, a consensus algorithm switching process in S301 is further provided, which specifically includes:
s1: the master node in the blockchain network starts the locking consensus process, and at this time, the master node rejects all messages for consensus.
S2: the master node sends a consensus algorithm handover message to all slave nodes.
S3: and after receiving the consensus algorithm switching message, each slave node broadcasts the reply message in the whole network.
S4: for each node in the blockchain network, when it receives a message from at least one of the nodes
Figure BDA0002809856770000072
And replying the message of each node, and performing consensus algorithm switching.
S5: when in a blockchain network
Figure BDA0002809856770000073
After the nodes complete the switching of the consensus algorithm, the new consensus algorithm takes effect to replace the old consensus algorithm.
The embodiment of the invention also provides a device for elastically adjusting consensus based on the centrality of the block link points, which comprises: the device comprises a CFT + BFT mixed type consensus device, a consensus algorithm starting module, a consensus algorithm switching judgment module and a consensus algorithm switching execution module;
the CFT + BFT mixed type consensus device comprises a CFT module and a BFT module; the CFT module provides a downtime fault-tolerant consensus algorithm; the BFT module provides a Byzantine fault-tolerant consensus algorithm;
the consensus algorithm starting module: calculating the number of nodes which can be directly connected with the ith node in the block chain network and recording as Ci(ii) a Judging whether the number of the direct-connected nodes exceeds a threshold value: if it is
Figure BDA0002809856770000074
Block chain network starts BFT module, fault tolerance number at this time
Figure BDA0002809856770000075
If it is
Figure BDA0002809856770000076
The BFT fault tolerance cannot be guaranteed, the block chain network starts the CFT module, and the fault tolerance number is at the moment
Figure BDA0002809856770000077
A consensus algorithm switching judgment module: in the execution process of the BFT module, when an error node occurs, calculating the medium centrality of the error node v, and recording the medium centrality as SVv(V (G), v), and judging whether the intermediary centrality exceeds a threshold value, if so
Figure BDA0002809856770000078
If the block chain network does not meet the Byzantine fault-tolerant requirement, the algorithm is switched to CFT type consensus, namely, the CFT module is switched to; if it is
Figure BDA0002809856770000079
The blockchain network meets the byzantine fault tolerance requirement and the algorithm does not need to be switched.
The consensus algorithm switching execution module: the master node in the block chain network starts a locking consensus process, and at the moment, the master node refuses all messages to perform consensus; the master node sends a consensus algorithm switching message to all the slave nodes; after receiving the consensus algorithm switching message, each slave node broadcasts the reply message in the whole network; for each node in the blockchain network, when it receives a message from at least one of the nodes
Figure BDA0002809856770000081
The reply message of each node is switched by a consensus algorithm; when in a blockchain network
Figure BDA0002809856770000082
After the nodes complete the switching of the consensus algorithm, the new consensus algorithm takes effect to replace the old consensus algorithm.
In one embodiment, a computer device is provided, which includes a memory and a processor, the memory stores computer readable instructions, and when the computer readable instructions are executed by the processor, the processor executes the steps of the method for adjusting consensus based on block link point centrality in the embodiments.
In one embodiment, a storage medium storing computer-readable instructions is provided, which when executed by one or more processors, cause the one or more processors to perform the steps of the method for elastic adjustment consensus based on block link point centrality in the above embodiments. The storage medium may be a nonvolatile storage medium.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by associated hardware instructed by a program, which may be stored in a computer-readable storage medium, and the storage medium may include: read Only Memory (ROM), Random Access Memory (RAM), magnetic or optical disks, and the like.
The above description is only for the purpose of illustrating the preferred embodiments of the one or more embodiments of the present disclosure, and is not intended to limit the scope of the one or more embodiments of the present disclosure, and any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the one or more embodiments of the present disclosure should be included in the scope of the one or more embodiments of the present disclosure.

Claims (8)

1. A block link point centrality based elastic adjustment consensus method is characterized in that the method is realized based on a mixed consensus of a CFT module and a BFT module; the CFT module provides a downtime fault-tolerant consensus algorithm, and the BFT module provides a Byzantine fault-tolerant consensus algorithm; the method comprises the following steps:
calculating the number C of nodes which the ith node can be directly connected in the blockchain networki；
Judging whether the number of the direct-connected nodes exceeds a threshold value:
if it is
Figure FDA0002809856760000011
Block chain network starts BFT module, fault tolerance number at this time
Figure FDA0002809856760000012
If it is
Figure FDA0002809856760000013
Block chain network starts CFT module, fault tolerance number at this moment
Figure FDA0002809856760000014
During the execution of the BFT module, when an error node occurs, calculating the medium centrality SV of the error node vv(v (g), v), the calculation formula is as follows:
Figure FDA0002809856760000015
wherein G isA current network topological graph V (G) is a set of all nodes in the topological graph G;
Figure FDA0002809856760000016
is a binomial random variable, which indicates whether the node v positively contributes to the path p;
Figure FDA0002809856760000017
the two-term random variable represents whether the node v negatively contributes to the path p;
Figure FDA0002809856760000018
is a set of shortest paths between nodes s, t passing through node v; sigmastThe number of shortest paths between nodes s, t; Ψ (p) is the set of all nodes on path p;
judging whether the intermediary centrality exceeds a threshold value:
if it is
Figure FDA0002809856760000019
If the block chain network does not meet the Byzantine fault tolerance requirement, switching to the CFT module;
if it is
Figure FDA00028098567600000110
The blockchain network meets the Byzantine fault tolerance requirement without switching the consensus algorithm.
2. The method of claim 1, wherein the activity requirement of the CFT module is: q is less than or equal to N-f, wherein Q is the number of legal nodes, N is the number of all nodes, f is the number of nodes with possible errors, and the CFT module is a downtime error node; the safety requirement is as follows: any two sets of legal nodes should be able to intersect one or more block link points, thus requiring 2Q-N > 0.
3. The method for elastic adjustment consensus based on block link point centrality according to claim 1, wherein an activity requirement of said BFT module is: q + f is less than or equal to N, wherein Q is the number of legal nodes, N is the number of all nodes, f is the number of nodes with possible errors, and aiming at the BFT module, a downtime error node and a Byzantine error node possibly exist at the same time; the safety requirement is as follows: the intersection of the legal node sets in the two-two consensus phase must at least contain S honest nodes, and the number of honest nodes should be greater than the number of wrong nodes, i.e., S > f, and is equivalent to 2Q-N > f.
4. The method as claimed in claim 1, wherein the intermediary centrality reflects a proportion of network traffic through a node, and the intermediary centrality comprehensively considers the influence of node location and its networking structure on the overall network stability.
5. The method of claim 1, wherein when switching from a BFT module to a CFT module is required, the following steps are performed:
the master node in the block chain network locks the consensus process, and at the moment, the master node refuses all messages to perform consensus;
the master node sends a consensus algorithm switching message to all the slave nodes;
after receiving the consensus algorithm switching message, each slave node broadcasts the reply message in the whole network;
when a node receives a message from at least
Figure FDA0002809856760000021
The reply message of each node is switched by a consensus algorithm;
when at least
Figure FDA0002809856760000022
After the nodes complete the switching of the consensus algorithm, the new consensus algorithm takes effect to replace the old consensus algorithm.
6. An apparatus for elastic adjustment consensus based on block link point centrality, the apparatus comprising: the device comprises a CFT + BFT mixed type consensus device, a consensus algorithm starting module, a consensus algorithm switching judgment module and a consensus algorithm switching execution module;
the CFT + BFT mixed type consensus device comprises a CFT module and a BFT module; the CFT module provides a downtime fault tolerance consensus algorithm; the BFT module provides a Byzantine fault-tolerant consensus algorithm;
the consensus algorithm starting module: calculating the number C of nodes which the ith node can be directly connected in the blockchain networki(ii) a If it is
Figure FDA0002809856760000023
N is the number of all nodes, the BFT module is started, and the fault-tolerant number is obtained at the moment
Figure FDA0002809856760000031
If it is
Figure FDA0002809856760000032
Starting CFT module, fault tolerance number
Figure FDA0002809856760000033
The consensus algorithm switching judgment module: in the execution process of the BFT module, when an error node occurs, calculating the medium centrality SV of the error node vv(V (G), v), if
Figure FDA0002809856760000034
Switching to the CFT module; if it is
Figure FDA0002809856760000035
The consensus algorithm is not switched; SVv(V (G), v) the calculation formula is as follows:
Figure FDA0002809856760000036
Figure FDA0002809856760000037
wherein G is the current network topological graph, and V (G) is the set of all nodes in the topological graph G;
Figure FDA0002809856760000038
is a binomial random variable, which indicates whether the node v positively contributes to the path p;
Figure FDA0002809856760000039
the two-term random variable represents whether the node v negatively contributes to the path p;
Figure FDA00028098567600000310
is a set of shortest paths between nodes s, t passing through node v; sigmastThe number of shortest paths between nodes s, t; Ψ (p) is the set of all nodes on path p;
the consensus algorithm switching execution module: a master node locking consensus process; the master node sends a consensus algorithm switching message to all the slave nodes; after receiving the consensus algorithm switching message, each slave node broadcasts the reply message in the whole network; when a node receives a message from at least
Figure FDA00028098567600000311
The reply message of each node is switched by a consensus algorithm; when at least
Figure FDA00028098567600000312
After the nodes complete the switching of the consensus algorithm, the new consensus algorithm takes effect to replace the old consensus algorithm.
7. A computer device comprising a memory and a processor, the memory having stored therein computer readable instructions which, when executed by the processor, cause the processor to perform the steps of the method of adjusting consensus based on block link point centrality according to any one of claims 1-5.
8. A storage medium having computer-readable instructions stored thereon which, when executed by one or more processors, cause the one or more processors to perform the steps of the method for elastic adjustment consensus based on block link point centrality of any one of claims 1-5.
CN202011386575.3A 2020-12-01 2020-12-01 Elastic adjustment consensus method and device based on block link point centrality Active CN112564960B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011386575.3A CN112564960B (en) 2020-12-01 2020-12-01 Elastic adjustment consensus method and device based on block link point centrality

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011386575.3A CN112564960B (en) 2020-12-01 2020-12-01 Elastic adjustment consensus method and device based on block link point centrality

Publications (2)

Publication Number Publication Date
CN112564960A true CN112564960A (en) 2021-03-26
CN112564960B CN112564960B (en) 2022-05-13

Family

ID=75047119

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011386575.3A Active CN112564960B (en) 2020-12-01 2020-12-01 Elastic adjustment consensus method and device based on block link point centrality

Country Status (1)

Country Link
CN (1) CN112564960B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113138853A (en) * 2021-04-09 2021-07-20 浙商银行股份有限公司 Block chain system self-adaptive service degradation method, equipment and storage medium
CN113761062A (en) * 2021-08-26 2021-12-07 浙商银行股份有限公司 Adaptive consensus algorithm switching method, device and storage medium
CN113779145A (en) * 2021-08-27 2021-12-10 浙商银行股份有限公司 Block chain throughput improving system and method
CN115412464A (en) * 2022-11-01 2022-11-29 江苏荣泽信息科技股份有限公司 Dynamic expansion scheme of block chain based on flow
WO2023179056A1 (en) * 2022-03-24 2023-09-28 腾讯科技（深圳）有限公司 Consensus processing method and apparatus of block chain network, device, storage medium, and program product
CN117236972A (en) * 2023-11-13 2023-12-15 浪潮(山东)农业互联网有限公司 Agricultural product traceability management method and system based on blockchain technology

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10200197B1 (en) * 2017-12-18 2019-02-05 Nec Corporation Scalable crash fault-tolerance consensus protocol with efficient message aggregation
CN110115001A (en) * 2018-11-07 2019-08-09 阿里巴巴集团控股有限公司 Promote practical Byzantine failure tolerance block chain common recognition synchronous with node
CN110365695A (en) * 2019-07-24 2019-10-22 中国工商银行股份有限公司 The block chain data interactive method and device of changeable common recognition algorithm
CN110674217A (en) * 2019-09-23 2020-01-10 百度在线网络技术（北京）有限公司 Block chain data processing method, device, equipment and medium
CN110995413A (en) * 2019-12-05 2020-04-10 杭州趣链科技有限公司 Alliance chain consensus node management method for preventing pseudo node attack
CN111478795A (en) * 2020-03-06 2020-07-31 重庆邮电大学 Alliance block chain network consensus method based on mixed Byzantine fault tolerance
CN111586102A (en) * 2020-04-07 2020-08-25 浙商银行股份有限公司 BFT consensus-based alliance chain networking method

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10200197B1 (en) * 2017-12-18 2019-02-05 Nec Corporation Scalable crash fault-tolerance consensus protocol with efficient message aggregation
CN110115001A (en) * 2018-11-07 2019-08-09 阿里巴巴集团控股有限公司 Promote practical Byzantine failure tolerance block chain common recognition synchronous with node
CN110365695A (en) * 2019-07-24 2019-10-22 中国工商银行股份有限公司 The block chain data interactive method and device of changeable common recognition algorithm
CN110674217A (en) * 2019-09-23 2020-01-10 百度在线网络技术（北京）有限公司 Block chain data processing method, device, equipment and medium
CN110995413A (en) * 2019-12-05 2020-04-10 杭州趣链科技有限公司 Alliance chain consensus node management method for preventing pseudo node attack
CN111478795A (en) * 2020-03-06 2020-07-31 重庆邮电大学 Alliance block chain network consensus method based on mixed Byzantine fault tolerance
CN111586102A (en) * 2020-04-07 2020-08-25 浙商银行股份有限公司 BFT consensus-based alliance chain networking method

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113138853A (en) * 2021-04-09 2021-07-20 浙商银行股份有限公司 Block chain system self-adaptive service degradation method, equipment and storage medium
CN113761062A (en) * 2021-08-26 2021-12-07 浙商银行股份有限公司 Adaptive consensus algorithm switching method, device and storage medium
CN113779145A (en) * 2021-08-27 2021-12-10 浙商银行股份有限公司 Block chain throughput improving system and method
WO2023179056A1 (en) * 2022-03-24 2023-09-28 腾讯科技（深圳）有限公司 Consensus processing method and apparatus of block chain network, device, storage medium, and program product
CN115412464A (en) * 2022-11-01 2022-11-29 江苏荣泽信息科技股份有限公司 Dynamic expansion scheme of block chain based on flow
CN117236972A (en) * 2023-11-13 2023-12-15 浪潮(山东)农业互联网有限公司 Agricultural product traceability management method and system based on blockchain technology
CN117236972B (en) * 2023-11-13 2024-02-09 浪潮(山东)农业互联网有限公司 Agricultural product traceability management method and system based on blockchain technology

Also Published As

Publication number Publication date
CN112564960B (en) 2022-05-13

Similar Documents

Publication Publication Date Title
CN112564960B (en) Elastic adjustment consensus method and device based on block link point centrality
Lei et al. Reputation-based byzantine fault-tolerance for consortium blockchain
CN112492016B (en) Cross-process extensible consensus method and system
WO2013052161A1 (en) Unifying connected dominating set using localized two hop information with a flexible dominating factor
CN109660624B (en) Planning method, server and storage medium for content distribution network resources
Lee et al. Fault-resilient real-time communication using software-defined networking
Maurer et al. On byzantine broadcast in loosely connected networks
CN112422320A (en) Master-slave switching method and device of server and server
CN111817959A (en) Network path management method and device, SDN controller and readable storage medium
CN111770477A (en) Deployment method and related device of protected resources of MEC network
CN112583708A (en) Connection relation control method and device and electronic equipment
Sridhar Decentralized local failure detection in dynamic distributed systems
KR101075462B1 (en) Method to elect master nodes from nodes of a subnet
Song et al. The building blocks of consensus
CN104410528A (en) Method for deploying minimum fault-tolerant coverage of controller based on software defined data center network
CN101616061A (en) The path determines that method, path determine device and network system
CN111107103A (en) Method, system and storage medium for maintaining performance of alliance chain
CN114244713B (en) Resource backup method and device for electric power 5G network slice
Derasevic et al. Appropriate consistent replicated voting for increased reliability in a node replication scheme over FTT
CN116846888A (en) Consensus processing method, device, equipment and storage medium of block chain network
Melit et al. An Ω-based leader election algorithm for mobile ad hoc networks
Zhao et al. The game theoretic consensus in a networked multi-agent system
Mišić et al. Arbitration mechanisms for multiple entry capability in PBFT for IoT systems
Hurfin et al. An adaptive Fast Paxos for making quick everlasting decisions
Fathollahnejad et al. On probabilistic analysis of disagreement in synchronous consensus protocols

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20220607

Address after: No. 1788, Hongning Road, Xiaoshan District, Hangzhou, Zhejiang 311200

Patentee after: CHINA ZHESHANG BANK Co.,Ltd.

Patentee after: Yiqiyin (Hangzhou) Technology Co., Ltd

Address before: No. 1788, Hongning Road, Xiaoshan District, Hangzhou, Zhejiang 311200

Patentee before: CHINA ZHESHANG BANK Co.,Ltd.