CN113194146A - Leader node determination method, computer device, and storage medium - Google Patents
Leader node determination method, computer device, and storage medium Download PDFInfo
- Publication number
- CN113194146A CN113194146A CN202110488632.7A CN202110488632A CN113194146A CN 113194146 A CN113194146 A CN 113194146A CN 202110488632 A CN202110488632 A CN 202110488632A CN 113194146 A CN113194146 A CN 113194146A
- Authority
- CN
- China
- Prior art keywords
- node
- block chain
- tenure
- leader node
- current
- 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
Links
Images
Classifications
-
- 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
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
- H04L67/1051—Group master selection mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Cardiology (AREA)
- General Health & Medical Sciences (AREA)
- Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Theoretical Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a leader node determining method, computer equipment and a storage medium, and relates to the technical field of block chains and the like, wherein the method comprises the following steps: receiving a first nominated transaction; the first nomination transaction is generated by a first block link point nomination first block link node which is a leader node of a current nomination later nomination period; when the first time length is reached, selecting a second block chain node from each first block chain node according to a preconfigured leader node selection rule, generating a first vote of the second block chain node and broadcasting; and determining the block link point which has the most votes as the leader node of the random period which is subsequent to the current random period. The leader node election success rate is improved.
Description
Technical Field
The application relates to the technical field of block chains, in particular to a leader node determining method, computer equipment and a storage medium.
Background
In some consensus algorithms in the field of existing block chains, a leader node generates data, and other nodes need to follow the data of the leader node, so that the selection and the transition of the leader node are important links.
The leader node is selected by most nodes in the cluster, and the leader node n1 with the expiration date of 3 regularly sends heartbeat packets to all the nodes when the leader node n1 normally exists; if one other node (e.g., n2) does not receive the heartbeat packet sent by n1 beyond time Thb, then it is assumed that n1 has failed and n2 nominates itself as the leader node with tenure of 4. And Thb for each node is random, so there will always be one node initiating election first. However, considering factors such as network delay, when the network condition is poor, there still exists a situation that a sufficient number of votes cannot be obtained by each node due to the fact that multiple nodes initiate elections simultaneously, and further, the next-due leader node can be elected through multiple elections, and the election mode is greatly influenced by the network condition.
Disclosure of Invention
In view of the above-mentioned drawbacks and deficiencies in the prior art, it is desirable to provide a leader node determination method, a computer device, and a storage medium that improve the success rate of leader node elections.
In a first aspect, the present invention provides a leader node determining method suitable for a block chain node, where each block chain node is configured with the same timeout duration, where the method includes:
receiving a first nominated transaction; when the first block chain node does not receive the heartbeat packet of the leader node in the current tenure within the timeout duration, the first block chain node is generated by the leader node in the next tenure of the current tenure;
when the first time length is reached, selecting a second block chain node from each first block chain node according to a preconfigured leader node selection rule, generating a first vote of the second block chain node and broadcasting;
and determining the block link point which has the most votes as the leader node of the random period which is subsequent to the current random period.
In a second aspect, the present invention also provides an apparatus comprising one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform a leader node determination method provided according to embodiments of the present invention.
In a third aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute the leader node determining method provided according to the embodiments of the present invention.
The leader node determining method, the computer device and the storage medium provided by the embodiments of the present invention receive a first nomination transaction; the first nomination transaction is generated by a first block link point nomination first block link node which is a leader node of a current nomination later nomination period; when the first time length is reached, selecting a second block chain node from each first block chain node according to a preconfigured leader node selection rule, generating a first vote of the second block chain node and broadcasting; and determining the block link point which has the most votes as the leader node of the next optional period of the current optional period, and improving the election success rate of the leader node.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of a leader node determining method according to an embodiment of the present invention.
FIG. 2 is a flow diagram of a preferred embodiment of the method shown in FIG. 1.
Fig. 3 is a flowchart of step S141 in a preferred embodiment of the method shown in fig. 2.
Fig. 4 is a flowchart of step S13 in a preferred embodiment of the method shown in fig. 3.
Fig. 5 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 is a flowchart of a leader node determining method according to an embodiment of the present invention. As shown in fig. 1, in this embodiment, the present invention provides a leader node determining method suitable for a blockchain node, where each blockchain node is configured with the same timeout duration, where the method includes:
s12: receiving a first nominated transaction; the first nominated transaction is generated by a first blockchain node which is a leader node of a next appointment after the current appointment when the first blockchain node does not receive a heartbeat packet of the leader node of the current appointment within the overtime length;
s14: when the first time length is reached, selecting a second block chain node from each first block chain node according to a preconfigured leader node selection rule, generating a first vote of the second block chain node and broadcasting;
s16: and determining the block link point which has the most votes as the leader node of the random period which is subsequent to the current random period.
Specifically, the consensus algorithm configured by the block chain nodes is used as a raft algorithm, and selecting a second block chain link point from each first block chain link point according to a preconfigured leader node selection rule comprises' performing hash operation on an tenure period number of a next tenure period of the current tenure period to obtain a tenure period hash; respectively calculating a first node ID of each first block chain node and a first XOR value of the hash at the expiration date; determining the block chain node with the minimum first exclusive-or value as a second block chain node as an example; assuming that the block chain has block link points n 1-n 7, the current tenure is 3, and the leader node of the current tenure is n 1;
n1 fails, and no heartbeat packet is sent to n 2-n 7;
n2 nominates itself as the leader node of tenure 4 when it reaches Thb, generates nominated trade tx2 and broadcasts;
n4 nominates itself as the leader node of tenure 4 when it reaches Thb, generates nominated trade tx4 and broadcasts;
n7 nominates itself as the leader node of tenure 4 when it reaches Thb, generates nominated trade tx7 and broadcasts;
take the current node as n3 as an example;
n3 performs S12, receives tx2, tx4, tx 7;
n3 executes step S14, and calculates a tenure hash (4) when the time length Tco is reached; and the number of the first and second groups,
calculating a nodeID (n2) xor hash (4), nodeID (n4) xor hash (4), nodeID (n7) xor hash (4);
assuming nodeID (n2) xor hash (4) > nodeID (n4) xor hash (4) > nodeID (n7) xor hash (4), n3 selects n7 and generates a vote for n7 and broadcasts;
assuming that there are votes n7 generated by n 3-n 7 and votes n2 generated by n2 in the final blockchain network, n3 executes step S16 to determine n7 as the leader node of the tenure 4.
In more embodiments, the consensus algorithm configured by the blockchain node may also be configured as other algorithms according to actual requirements, and the same technical effect may be achieved as long as the algorithm has a leader node and other nodes need to follow the data of the leader node.
In further embodiments, the method for selecting the second block link node from each first block link node according to the preconfigured leader node selection rule may also be configured according to actual requirements, for example, a simple method for computing the hash at will is changed: performing two times of hash operation on the tenure number of the next tenure of the current tenure to obtain a tenure hash; or, replacing "the blockchain node with the smallest first xor value is determined as the second blockchain node" with "the blockchain node with the largest first xor value is determined as the second blockchain node" may achieve the same technical effect.
It will be appreciated by those skilled in the art that the nomination transaction may be certified on the blockchain as proof of change of the leader node, and if it is not required to certify proof of change of the leader node on the blockchain, the nomination transaction may be signed nomination information, e.g., tx2 to msg (addr (n2)) _ sig (n2), which may achieve the same technical effect.
The embodiment improves the election success rate of the leader node.
FIG. 2 is a flow diagram of a preferred embodiment of the method shown in FIG. 1. As shown in fig. 2, in a preferred embodiment, before S14, the method further includes:
s13: generating and broadcasting a second nominated transaction; when the current node does not receive the heartbeat packet of the leader node in the current tenure within the timeout duration, the second nominated transaction is generated by the leader node in the next tenure after the current tenure;
s14 includes:
s141: and when the first time length is reached, selecting a second block chain node from the first block chain nodes and the current node according to a pre-configured leader node selection rule, generating a first vote of the second block chain node and broadcasting.
FIG. 2 differs from the embodiment shown in FIG. 1 in that in the embodiment shown in FIG. 1, some nodes may choose not to generate nominated transactions as is practical (assuming n3 does not generate nominated transactions to compete as the next opportune leader node given that the performance device of n3 is not optimal); in the embodiment shown in FIG. 2, all online nodes generate nominated transactions as the leader node of the next tenure;
in the method shown in fig. 2, n3, n5, n6 also generate nominated transactions tx3, tx5, tx6, respectively, and broadcast.
Fig. 3 is a flowchart of step S141 in a preferred embodiment of the method shown in fig. 2. As shown in fig. 3, in a preferred embodiment, S141 includes:
s1411: performing hash operation on the tenure number of the current tenure in the next tenure to obtain a tenure hash;
s1412: respectively calculating a first node ID of each first block chain node and a first XOR value of the hash at an expiration date, and calculating a second XOR value of the node ID of the current node and the hash at the expiration date;
s1413: when the second exclusive-or value is smaller than any first exclusive-or value, determining the current node as a second block chain node;
s1414: and when any first exclusive-or value is smaller than the second exclusive-or value, determining the block chain node with the smallest first exclusive-or value as a second block chain node.
Specifically, n3 executes step S1411 to obtain the expiration hash (4);
n3 executes step S1412, calculating nodeID (n2) xor hash (4) -nodeID (n7) xor hash (4);
if the nodeID (n3) xor hash (4) is less than the other XOR value, go to step S1413, select n 3;
if there are other xor values smaller than the nodeID (n3) xor hash (4), assuming nodeID (n2) xor hash (4) > nodeID (n3) xor hash (4) > nodeID (n4) xor hash (4) … … > nodeID (n7) xor hash (4), step S1414 is performed to select n 7.
Fig. 4 is a flowchart of step S13 in a preferred embodiment of the method shown in fig. 3.
As shown in fig. 4, in a preferred embodiment, step S13 includes:
s131: generating a second nominated transaction;
s1321: when the second time length is reached, judging whether any first exclusive-or value is smaller than a second exclusive-or value:
otherwise, go to step S1322: broadcasting the second nominated transaction;
wherein the second duration is included in the first duration.
Assuming that n3 considers that the performance device of n3 is not optimal, although n3 generates nominated transaction tx3 in step S131, if n3 receives other nominated transactions within the second time period, n3 broadcasts tx3 to the blockchain only if n3 determines that the xor values of other nodes are all greater than the xor value of n 3; correspondingly, it may be configured that if n3 determines that the xor value of any other node is smaller than the xor value of n3, tx3 is not broadcasted to the blockchain, so that the same technical effect can be achieved.
Those skilled in the art will appreciate that not broadcasting tx3 to the blockchain may reduce the number of communications for the blockchain network.
Preferably, the method further comprises:
receiving second votes of other block link points to the node;
when the first time length is reached, selecting a second block chain node from the first block chain nodes according to a preconfigured leader node selection rule, generating a first vote of the second block chain node, and broadcasting the vote, wherein the first vote comprises:
when the first time length is reached, selecting a second block chain node from each first block chain node according to a preconfigured leader node selection rule, and generating a first vote of the second block chain node;
signing each second vote to generate a third vote for a second blockchain node, respectively;
each third vote and the first vote is broadcast.
Specifically, n3 received a vote of n 2;
n3, when the time length Tco is reached, selecting a second block chain node as n7, and generating a vote of n 7;
n3 signs the vote of n2 to generate a vote' of n 7;
n3 broadcasts a vote' of n7 and a vote of n 7.
In further embodiments, if n3 receives second votes from multiple nodes on the node, n3 may also sign each second vote to generate one vote of n7, and then broadcast the "vote of n 7" and the "vote of n 7", which may achieve the same technical effect.
The above-described embodiments expedite the leader node determination for the next tenure.
Fig. 5 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
As shown in fig. 5, as another aspect, the present application also provides a computer apparatus including one or more Central Processing Units (CPUs) 601 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM603, various programs and data necessary for the operation of the computer apparatus are also stored. The CPU601, ROM602, and RAM603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.
In particular, according to an embodiment of the present disclosure, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing any of the methods described above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a computer-readable storage medium that exists separately and is not assembled into a computer device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present application.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each of the described units may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of a unit or module does not in some way constitute a limitation of the unit or module itself.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (8)
1. A leader node determination method, wherein each of the block link nodes is configured with the same timeout duration, the method being applicable to the block link nodes, the method comprising:
receiving a first nominated transaction; when the first nominated transaction does not receive the heartbeat packet of the leader node in the current tenure within the timeout duration, the nominated first blockchain node is generated by the leader node in the next tenure after the current tenure;
when the first time length is reached, selecting a second block chain node from each first block chain node according to a preconfigured leader node selection rule, generating a first vote of the second block chain node and broadcasting;
and determining the block link point which has the most votes as the leader node of the random period which is subsequent to the current random period.
2. The method of claim 1, wherein before the first time duration is reached, further comprising:
generating and broadcasting a second nominated transaction; when the current node does not receive the heartbeat packet of the leader node in the current tenure within the timeout duration, the second nominated transaction is generated by the leader node in the next tenure after the current tenure;
selecting a second block link point from each of the first block link points according to a preconfigured leader node selection rule comprises:
and selecting a second block chain node from each first block chain node and the current node according to a pre-configured leader node selection rule.
3. The method of claim 2, wherein selecting a second block link point from each of the first block link nodes, the current node, according to a preconfigured leader node selection rule comprises:
performing hash operation on the tenure number of the current tenure in the next tenure to obtain a tenure hash;
respectively calculating a first node ID of each first block chain node and a first XOR value of the hash at the expiration date, and calculating a second XOR value of the node ID of the current node and the hash at the expiration date;
when the second exclusive-or value is smaller than any one of the first exclusive-or values, selecting a current node as the second blockchain node;
and when any first exclusive-or value is smaller than the second exclusive-or value, selecting the block chain node with the smallest first exclusive-or value as the second block chain node.
4. The method of claim 3, wherein generating and broadcasting the second nominated transaction comprises:
generating a second nominated transaction;
when reaching a second time length, judging whether any first exclusive-or value is smaller than the second exclusive-or value:
if not, broadcasting the second nomination transaction;
wherein the second duration is included in the first duration.
5. The method of claim 4, further comprising:
receiving second votes of other block link points to the node;
when any one of the first exclusive-or values is smaller than the second exclusive-or value, and when the first time length is reached, selecting a second block chain node from the first block chain nodes according to a preconfigured leader node selection rule, and generating and broadcasting a first vote of the second block chain node comprises:
when the first time length is reached, selecting a second block chain node from each first block chain node according to a preconfigured leader node selection rule, and generating a first vote of the second block chain node;
signing each of the second votes to generate a third vote for the second blockchain node, respectively;
broadcasting each of the third votes and the first votes.
6. The method according to any one of claims 1-5, wherein the consensus algorithm configured for blockchain nodes is a raft algorithm.
7. A computer device, the device comprising:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-6.
8. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110488632.7A CN113194146B (en) | 2021-05-06 | 2021-05-06 | Leader node determination method, computer device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110488632.7A CN113194146B (en) | 2021-05-06 | 2021-05-06 | Leader node determination method, computer device, and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113194146A true CN113194146A (en) | 2021-07-30 |
| CN113194146B CN113194146B (en) | 2022-10-28 |
Family
ID=76983530
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110488632.7A Active CN113194146B (en) | 2021-05-06 | 2021-05-06 | Leader node determination method, computer device, and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113194146B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113873023A (en) * | 2021-09-23 | 2021-12-31 | 北京新华夏信息技术有限公司 | Leader node election method, device, equipment and storage medium |
| CN114140102A (en) * | 2021-12-02 | 2022-03-04 | 杭州复杂美科技有限公司 | Transaction sending method, computer device and storage medium |
| CN114726856A (en) * | 2022-02-28 | 2022-07-08 | 重庆市先进区块链研究院 | Self-adaptive master selection method based on Raft |
| CN116055279A (en) * | 2022-12-19 | 2023-05-02 | 湘潭大学 | Weighted voting consensus method based on network time delay |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106878071A (en) * | 2017-01-25 | 2017-06-20 | 上海钜真金融信息服务有限公司 | A kind of block chain common recognition mechanism based on Raft algorithms |
| CN109255713A (en) * | 2018-11-12 | 2019-01-22 | 裴若含 | In a kind of block chain network in certain time period book keeping operation power acquisition methods |
| CN109660367A (en) * | 2018-11-21 | 2019-04-19 | 语联网（武汉）信息技术有限公司 | Reach method, apparatus and electronic equipment based on the common recognition for improving Raft algorithm |
| CN109978516A (en) * | 2019-03-06 | 2019-07-05 | 西安电子科技大学 | The manufacture of block and synchronous method, information data processing terminal in block chain network |
| US20190394267A1 (en) * | 2018-06-26 | 2019-12-26 | Anami Holdings, Inc. | Dynamic voting nodes in blockchain networks |
| CN111291014A (en) * | 2020-02-18 | 2020-06-16 | 杭州复杂美科技有限公司 | Block chain consensus method, device and storage medium |
| CN112261135A (en) * | 2020-10-22 | 2021-01-22 | 腾讯科技（深圳）有限公司 | Node election method, system, device and equipment based on consistency protocol |
| WO2021023304A1 (en) * | 2019-08-07 | 2021-02-11 | 华为技术有限公司 | Fork processing method and blockchain node |
-
2021
- 2021-05-06 CN CN202110488632.7A patent/CN113194146B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106878071A (en) * | 2017-01-25 | 2017-06-20 | 上海钜真金融信息服务有限公司 | A kind of block chain common recognition mechanism based on Raft algorithms |
| US20190394267A1 (en) * | 2018-06-26 | 2019-12-26 | Anami Holdings, Inc. | Dynamic voting nodes in blockchain networks |
| CN109255713A (en) * | 2018-11-12 | 2019-01-22 | 裴若含 | In a kind of block chain network in certain time period book keeping operation power acquisition methods |
| CN109660367A (en) * | 2018-11-21 | 2019-04-19 | 语联网（武汉）信息技术有限公司 | Reach method, apparatus and electronic equipment based on the common recognition for improving Raft algorithm |
| CN109978516A (en) * | 2019-03-06 | 2019-07-05 | 西安电子科技大学 | The manufacture of block and synchronous method, information data processing terminal in block chain network |
| WO2021023304A1 (en) * | 2019-08-07 | 2021-02-11 | 华为技术有限公司 | Fork processing method and blockchain node |
| CN111291014A (en) * | 2020-02-18 | 2020-06-16 | 杭州复杂美科技有限公司 | Block chain consensus method, device and storage medium |
| CN112261135A (en) * | 2020-10-22 | 2021-01-22 | 腾讯科技（深圳）有限公司 | Node election method, system, device and equipment based on consistency protocol |
Non-Patent Citations (1)
| Title |
|---|
| 王江等: "类Paxos共识算法研究进展", 《计算机研究与发展》, vol. 56, no. 4, 15 April 2019 (2019-04-15), pages 692 - 707 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113873023A (en) * | 2021-09-23 | 2021-12-31 | 北京新华夏信息技术有限公司 | Leader node election method, device, equipment and storage medium |
| CN113873023B (en) * | 2021-09-23 | 2024-04-02 | 北京新华夏信息技术有限公司 | Leader node election method, leader node election device, leader node election equipment and storage medium |
| CN114140102A (en) * | 2021-12-02 | 2022-03-04 | 杭州复杂美科技有限公司 | Transaction sending method, computer device and storage medium |
| CN114726856A (en) * | 2022-02-28 | 2022-07-08 | 重庆市先进区块链研究院 | Self-adaptive master selection method based on Raft |
| CN116055279A (en) * | 2022-12-19 | 2023-05-02 | 湘潭大学 | Weighted voting consensus method based on network time delay |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113194146B (en) | 2022-10-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113194146B (en) | Leader node determination method, computer device, and storage medium | |
| CN108964879B (en) | Lottery drawing method, consensus method, device and storage medium | |
| CN110852882B (en) | Packet consensus method, apparatus, device, and medium for blockchain networks | |
| US20220035796A1 (en) | Block Confirmation Method, Device and Storage Medium | |
| CN111798238B (en) | Parallel chain consensus method, apparatus and storage medium | |
| CN113282348B (en) | Edge calculation task unloading system and method based on block chain | |
| CN111130790A (en) | Block co-recognition method based on block chain node network | |
| CN111008249B (en) | Parallel chain block synchronization method, device and storage medium | |
| CN110490734B (en) | Transaction group construction and broadcasting method and system, equipment and storage medium | |
| CN112104693A (en) | Task unloading method and device for non-uniform mobile edge computing network | |
| CN112184228B (en) | Asset exchange method, device and storage medium | |
| CN111310242B (en) | Method and device for generating device fingerprint, storage medium and electronic device | |
| CN110322350B (en) | Method, device, equipment and storage medium for cutting hollow block in consensus network | |
| CN112751785A (en) | Method and device for sending to-be-processed request, computer equipment and storage medium | |
| CN116582550A (en) | Method for constructing cross-chain system based on trust evaluation, transaction transfer method and device | |
| CN113703970B (en) | Auction mechanism-based server resource allocation method, device, equipment and medium | |
| CN115879889A (en) | Service processing method and device based on block chain and computer equipment | |
| CN116389040A (en) | Reputation-based blockchain consensus method, device and computer equipment | |
| CN112819625B (en) | Parallel chain arbitration consensus method, computer device, and storage medium | |
| CN108964878B (en) | Lottery drawing method, consensus method, device and storage medium | |
| CN112948388A (en) | Parallel chain arbitration consensus method, computer device and storage medium | |
| CN114118358A (en) | Image processing method, image processing apparatus, electronic device, medium, and program product | |
| CN112866365A (en) | Node communication method, computer device, and storage medium | |
| CN112052250A (en) | Performance measurement method, broadcast performance adjustment method, device and storage medium | |
| CN113206882B (en) | Consensus method, computer device and storage medium |
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 |