CN112714177A - PBFT improved algorithm with linear message complexity - Google Patents
PBFT improved algorithm with linear message complexity Download PDFInfo
- Publication number
- CN112714177A CN112714177A CN202011551994.8A CN202011551994A CN112714177A CN 112714177 A CN112714177 A CN 112714177A CN 202011551994 A CN202011551994 A CN 202011551994A CN 112714177 A CN112714177 A CN 112714177A
- Authority
- CN
- China
- Prior art keywords
- consensus
- pbft
- network
- raft
- consensus network
- 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
-
- 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/30—Decision processes by autonomous network management units using voting and bidding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/02—Network architectures or network communication protocols for network security for separating internal from external traffic, e.g. firewalls
-
- 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
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computing Systems (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Theoretical Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a PBFT improved algorithm with linear message complexity, S1, establishing an improved PBFT network; s2, an improved pre-preparation stage; s3, an improved prepare stage; s4, an improved commit stage; and S5, feeding back all commit messages to the Client side, and after the Client side receives 2f +1 consistent reply response messages, determining that the round achieves consensus. The invention provides a new consensus algorithm based on a series of problems of the consensus algorithm used in the existing alliance chain. The new algorithm optimizes the three-stage flow of PBFT consensus by introducing an efficient RAFT network, and finally realizes the communication complexity of the consensus information from o (n)2) And the conversion to linearity solves the single-point bandwidth bottleneck problem of the consensus node.
Description
Technical Field
The invention relates to the technical field of consensus algorithms, in particular to a PBFT improved algorithm with linear message complexity.
Background
With the development and wide application of blockchains, the consensus algorithm, which is one of the core technologies, is gaining wide attention in academia and industry.
There are various consensus algorithms in the industry at present, and there are two types of consensus algorithms that are more mainstream in the federation chain: the method comprises a BFT algorithm and a non-BFT algorithm, wherein the non-BFT algorithm, namely a non-Byzantine fault-tolerant algorithm, is a deterministic consensus algorithm, namely after consensus is achieved, all nodes obtain a deterministic and same result, errors which can be tolerated by the method are only node faults, and malicious attacks cannot be tolerated. Such algorithms are typically Paxos, RAFT consensus algorithm, etc. The BFT algorithm, i.e. the byzantine fault-tolerant algorithm, is also a deterministic consensus algorithm, and can tolerate malicious attacks, such as sending false information, sending different information to different nodes, and the like, besides general faults. The classical BFT algorithm such as PBFT, like Fabric, people, fun chain, etc. at present, can select different kinds of consensus algorithms according to the use scenes.
In the prior art, however, a non-BFT algorithm is simple, efficient and has linear message complexity, but cannot tolerate a scene with byzantine nodes; the PBFT algorithm, and many BFT-like consensus algorithms based on the improvement of the PBFT algorithm, have an average o (n) although it can tolerate Byzantine node errors2) The message complexity is increased rapidly along with the increase of the number of the nodes, and the overall throughput of the consensus protocol is reduced rapidly; and in PBFTIn the classic three-stage process of the algorithm, each consensus node needs to broadcast the consensus information, which easily causes the single-point bandwidth bottleneck problem of the consensus nodes.
Therefore, how to provide a PBFT improvement algorithm with linear message complexity that can effectively solve the single-point bandwidth bottleneck problem of the consensus node existing in the conventional PBFT algorithm is a problem that needs to be solved by those skilled in the art.
Disclosure of Invention
In view of the above, the present invention provides a PBFT improved algorithm with linear message complexity, and the present invention provides a new consensus algorithm based on a series of problems of the consensus algorithm used in the existing federation chain. The new algorithm optimizes the three-stage flow of PBFT consensus by introducing an efficient RAFT network, and finally realizes the communication complexity of the consensus information from o (n)2) And the conversion to linearity solves the single-point bandwidth bottleneck problem of the consensus node.
In order to achieve the purpose, the invention adopts the following technical scheme:
a PBFT improvement algorithm with linear message complexity comprising the steps of:
s1, establishing an improved PBFT network: establishing safe communication connection among all the consensus nodes in the PBFT consensus network, all the consensus nodes in the RAFT consensus network and all the consensus nodes between the PBFT consensus network and the RAFT consensus network to form an improved PBFT network;
s2. improved pre-preparation stage: after receiving a consensus message sent by a client, a Leader node in the PBFT consensus network packages the consensus message and sends the consensus message to a current appointed Leader node of the RAFT consensus network on the same physical node as the PBFT consensus network, wherein the RAFT consensus network synchronizes the consensus message in the network as a new pre-preamble message, and if other consensus nodes except the Leader node in the PBFT consensus network obtain consistent pre-preamble votes from different consensus nodes in the RAFT consensus network, S3 is performed;
s3, an improved prepare stage: sending a prefix message to a current optional period Leader node of the RAFT consensus network by other nodes except the Leader in the PBFT consensus network and synchronizing in the RAFT consensus network, and if any consensus node in the PBFT consensus network obtains 2f +1 consistent prefix votes from different consensus nodes of the RAFT consensus network and passes the verification, performing S4; wherein f is the number of the failed nodes in the PBFT consensus network;
s4, an improved commit stage: each node in the PBFT consensus network sends commit messages to the current deadline Leader node of the RAFT consensus network and synchronizes to all consensus nodes in the RAFT consensus network, if any consensus node of the PBFT consensus network obtains 2f +1 commit votes from different consensus nodes in the RAFT consensus network, whether hash values contained in the messages are consistent or not is verified, and if the verification is passed, the consensus process is completed;
and S5, each node of the PBFT consensus network sends a reply response to a client.
Preferably, the current deadline Leader is changed in the RAFT consensus network, and the node of the PBFT consensus network sends a message to the current deadline Leader of the RAFT consensus network at each stage.
Preferably, the following is also included:
before performing a pre-preparation stage of S2 improvement, establishing secure communication connections among all consensus nodes in the PBFT consensus network, all consensus nodes in the RAFT consensus network, and all consensus nodes between the PBFT consensus network and the RAFT consensus network, wherein a Leader node in the PBFT consensus network checks a network connection condition between itself and the RAFT consensus network:
if the PBFT network cannot be connected, entering a pre-preparation stage of the PBFT consensus network; if so, the process proceeds directly to S2.
Preferably, the following is also included:
before proceeding with the stage of S3 modified preparation, each node in the PBFT consensus network checks its network connection with the RAFT consensus network:
if the PBFT network cannot be connected, entering a prepare stage of the PBFT consensus network; if so, S3 is performed directly.
Preferably, the following is also included:
before proceeding with the commit phase of S4 improvement, each node in the PBFT consensus network checks its network connection situation with the RAFT consensus network:
if the PBFT is not communicated with the PBFT, entering a commit stage of the PBFT consensus network; if so, S4 is performed directly.
Preferably, the following is also included:
after each piece of consensus information is synchronously completed by the nodes of the RAFT consensus network, the corresponding PBFT nodes are called to carry out consistency verification and message quantity verification.
According to the technical scheme, compared with the prior art, the invention discloses and provides the PBFT improved algorithm with linear message complexity, and the invention combines the PBFT consensus network with the efficient RAFT consensus network to ensure that the average message complexity of three stages of PBFT consensus is O (n)2) The method reduces the bandwidth to O (n), improves the three-stage consensus process of the PBFT network in the prior art, ensures that the consensus information of each stage is not broadcasted any more, and only needs to be sent to the RAFT consensus network, thereby solving the single-point bandwidth bottleneck problem of the consensus node; and the consensus network in the algorithm is freely switched, and does not depend on a network in a single environment, so that the fault tolerance of the consensus is effectively enhanced.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
FIG. 1 is a flow chart of a PBFT improvement algorithm with linear message complexity according to the present invention;
fig. 2 is a schematic flow chart of the application of the PBFT improvement algorithm with linear message complexity in the model according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the 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 invention.
The embodiment of the invention discloses a PBFT improved algorithm with linear message complexity, which comprises the following steps as shown in figures 1-2:
s1, establishing an improved PBFT (basic function framework) consensus network, wherein the improved PBFT consensus network comprises a PBFT consensus network and an RAFT consensus network, and establishing safe communication connection among all consensus nodes in the PBFT consensus network, all consensus nodes in the RAFT consensus network and all consensus nodes of the PBFT consensus network and the RAFT consensus network;
in this embodiment, as shown in fig. 1, clients are clients submitting consensus requests, and Peer0, Peer1, Peer2 and Peer3 are four consensus nodes in a PBFT consensus network, and the Peer0 is selected as a leader according to a policy selected by the leader when the nodes are started. Leader in RAFT consensus network is the Leader, Follower0, Follower1, Follower2 are three followers.
Both consensus networks are in an active state waiting for messages to be agreed. Each consensus node in the PBFT consensus network has established a secure communication connection with all nodes of the RAFT consensus network.
S2. improved pre-preparation stage
The Peer0 node, as the leader of the PBFT consensus network, first checks for network connectivity in the RAFT consensus network. If the connection cannot be realized, a normal pre-preparation stage is carried out in the original consensus network; otherwise, performing an optimized pre-preparation consensus process. Peer0 sends a packaged consensus message to the current deadline Leader node of the RAFT consensus network, and the pre-preamble message is synchronized between the Follower nodes as a new proposal value in the RAFT consensus network, wherein the proposal value is the pre-preamble message sent by the PBFT Leader to the RAFT. Each time the consensus information is synchronized, the node in the RAFT consensus network calls the consensus node in the PBFT consensus network corresponding to the node to perform the process of the consensus process (in order to avoid confusion, only the Peer3 is shown to obtain the per-preamble information in this embodiment, and only the Peer3 is shown at the later stage to obtain the consensus information). All normal nodes of the RAFT consensus network can act as providers of pre-prepare messages. The invention improves the stage, so that Peer0 changes from broadcasting the consensus message into sending a single message to the current appointed Leader node of the RAFT consensus network.
S3, 4 modified prepare and modified commit stage
And after the other nodes except the Leader in the PBFT consensus network acquire the pre-prefix message from the RAFT consensus network and verify the pre-prefix message, sending the other nodes except the Leader in the PBFT consensus network to the current deadline Leader node of the RAFT consensus network and synchronizing in the RAFT consensus network. Peer1, Peer2, Peer3 no longer conduct the broadcast process of voting as in the preamble phase of the classical PBFT consensus network. If any node in Peer0, Peer1, Peer2 and Peer3 acquires consistent prefix votes from different consensus nodes from the RAFT consensus network, entering a commit stage, sending a commit message to a current deadline Leader of the RAFT consensus network, synchronizing the message in the whole RAFT consensus network again, and calling the consensus node in the PBFT consensus network corresponding to the node to process the consensus process each time the consensus message is synchronized. And before proceeding with the stage of preparation of the S3 improvement, each node in the PBFT consensus network checks the network connection situation of itself with the RAFT consensus network group: if the connection cannot be realized, entering a prefix stage of the PBFT consensus network; if so, S3 is performed directly.
Further, the present invention improves the message complexity of the consensus process, but does not rely strongly on RAFT consensus networks. Once the RAFT consensus network is abnormal and the communication connection between the PBFT consensus network and the RAFT consensus network is disconnected, the Peer0 does not rely on the RAFT consensus network any more, but returns to the original processing flow. As shown in fig. 1, when the optimized consensus process is operated, before the commit stage starts, the RAFT consensus network is abnormal, and the Peer0, Peer1, Peer2 and Peer3 cannot send a single commit message to the current deadline Leader of the RAFT consensus network any more, and at this time, the PBFT consensus node returns to the original broadcast commit message process, and continues to complete voting in the commit stage. When the optimized consensus protocol is operated, only the RAFT consensus network is required to be normal, and communication connection conditions among Peer0, Peer1, Peer2 and Peer3 nodes are not required. The free switching between the consensus networks reduces the dependence on a single network environment, so that the consensus can still be normally achieved under the condition that one consensus network is abnormal.
The following process flow S5 has the same detailed steps as the classical PBFT consensus algorithm.
The following further illustrates the beneficial effects of the present invention:
1. the single-point bandwidth bottleneck problem of the main node is solved: in the improved pre-prefix stage, the main node does not broadcast the packed message any more, directly sends the message to the current deadline Leader node in the RAFT network group, and hands the consensus process to the RAFT consensus network for processing, thereby solving the single-point bandwidth bottleneck problem of the main node in the PBFT protocol, and reducing the message complexity of the main node from o (n) to o (1), wherein n is the number of the running nodes.
2. And (3) carrying out network isolation: and after the RAFT consensus network is processed, the corresponding nodes in the PBFT consensus network are called to carry out the processing of the consensus process, and the main node of the PBFT consensus network is not relied on.
3. Reducing the average message complexity of the algorithm: on the basis of the foregoing, in the preamble stage and the commit stage, the consensus nodes of all the PBFT networks no longer broadcast the consensus message, and only need to send the message to the current deadline Leader node of the RAFT consensus network. Similarly, after being processed by the RAFT consensus network, the RAFT consensus network calls the self-correspondingThe nodes of the PBFT consensus network carry out the processing of the consensus process, thereby reducing the message complexity to be linear and ensuring that the average message complexity of three stages of consensus is O (n)2) Reduced to O (n).
4. The problem of the bottleneck of all single-point bandwidths is solved: in conclusion, all nodes of the PBFT consensus network do not need to be communicated with each other in the whole algorithm process, and the single-point bandwidth bottleneck problem of all the nodes can be solved.
5. And (3) increasing the network fault tolerance: as shown in fig. 1, the PBFT protocol and the RAFT protocol can be freely switched, and when the PBFT consensus network and the RAFT consensus network cannot be connected, the PBFT consensus network recovers its original protocol flow, thereby increasing the fault tolerance of the algorithm.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. The device disclosed by the embodiment corresponds to the method disclosed by the embodiment, so that the description is simple, and the relevant points can be referred to the method part for description.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (6)
1. A PBFT improvement algorithm with linear message complexity comprising the steps of:
s1, establishing an improved PBFT network: establishing safe communication connection among all the consensus nodes in the PBFT consensus network, all the consensus nodes in the RAFT consensus network and all the consensus nodes between the PBFT consensus network and the RAFT consensus network to form an improved PBFT network;
s2. improved pre-preparation stage: after receiving a consensus message sent by a client, a Leader node in the PBFT consensus network packages the consensus message and sends the consensus message to a current appointed Leader node of the RAFT consensus network on the same physical node as the PBFT consensus network, wherein the RAFT consensus network synchronizes the consensus message in the network as a new pre-preamble message, and if other consensus nodes except the Leader node in the PBFT consensus network obtain consistent pre-preamble votes from different consensus nodes in the RAFT consensus network, S3 is performed;
s3, an improved prepare stage: sending a prefix message to a current optional period Leader node of the RAFT consensus network by other nodes except the Leader in the PBFT consensus network and synchronizing in the RAFT consensus network, and if any consensus node in the PBFT consensus network obtains 2f +1 consistent prefix votes from different consensus nodes of the RAFT consensus network and passes the verification, performing S4; wherein f is the number of the failed nodes in the PBFT consensus network;
s4, an improved commit stage: each node in the PBFT consensus network sends commit messages to the current deadline Leader node of the RAFT consensus network and synchronizes to all consensus nodes in the RAFT consensus network, if any consensus node of the PBFT consensus network obtains 2f +1 commit votes from different consensus nodes in the RAFT consensus network, whether hash values contained in the messages are consistent or not is verified, and if the verification is passed, the consensus process is completed;
and S5, each node of the PBFT consensus network sends a reply response to a client.
2. The PBFT improvement algorithm with linear message complexity according to claim 1, wherein the current deadline Leader is changed in a RAFT consensus network, and nodes of the PBFT consensus network send messages to the current deadline Leader of the RAFT consensus network at various stages.
3. The PBFT refinement algorithm with linear message complexity according to claim 1, further comprising:
before performing a pre-preparation stage of S2 improvement, establishing secure communication connections among all consensus nodes in the PBFT consensus network, all consensus nodes in the RAFT consensus network, and all consensus nodes between the PBFT consensus network and the RAFT consensus network, wherein a Leader node in the PBFT consensus network checks a network connection condition between itself and the RAFT consensus network:
if the PBFT network cannot be connected, entering a pre-preparation stage of the PBFT consensus network; if so, the process proceeds directly to S2.
4. The PBFT refinement algorithm with linear message complexity according to claim 1, further comprising:
before proceeding with the stage of S3 modified preparation, each node in the PBFT consensus network checks its network connection with the RAFT consensus network:
if the PBFT network cannot be connected, entering a prepare stage of the PBFT consensus network; if so, S3 is performed directly.
5. The PBFT refinement algorithm with linear message complexity according to claim 1, further comprising:
before proceeding with the commit phase of S4 improvement, each node in the PBFT consensus network checks its network connection situation with the RAFT consensus network:
if the PBFT is not communicated with the PBFT, entering a commit stage of the PBFT consensus network; if so, S4 is performed directly.
6. The PBFT refinement algorithm with linear message complexity according to claim 1, further comprising:
after each piece of consensus information is synchronously completed by the nodes of the RAFT consensus network, the corresponding PBFT nodes are called to carry out consistency verification and message quantity verification.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011551994.8A CN112714177B (en) | 2020-12-24 | 2020-12-24 | PBFT improved algorithm with linear message complexity |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011551994.8A CN112714177B (en) | 2020-12-24 | 2020-12-24 | PBFT improved algorithm with linear message complexity |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112714177A true CN112714177A (en) | 2021-04-27 |
| CN112714177B CN112714177B (en) | 2022-11-29 |
Family
ID=75544299
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011551994.8A Active CN112714177B (en) | 2020-12-24 | 2020-12-24 | PBFT improved algorithm with linear message complexity |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112714177B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113467919A (en) * | 2021-07-19 | 2021-10-01 | 中国银行股份有限公司 | Process management method, system and storage medium based on block chain |
| CN113609229A (en) * | 2021-08-18 | 2021-11-05 | 东北大学 | Rapid log replication method and device in Fabric Block chain |
| CN113837758A (en) * | 2021-09-27 | 2021-12-24 | 深圳前海微众银行股份有限公司 | Consensus method and device for block chain system |
| CN114172659A (en) * | 2021-11-30 | 2022-03-11 | 中国建设银行股份有限公司 | Message transmission method, device, equipment and storage medium in block chain system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108616596A (en) * | 2018-05-09 | 2018-10-02 | 南京邮电大学 | It is adaptively known together method based on the block chain that dynamic authorization and network environment perceive |
| CN110289966A (en) * | 2019-06-19 | 2019-09-27 | 西南交通大学 | Anti-adaptive attack alliance's chain common recognition method based on Byzantine failure tolerance |
| CN110298754A (en) * | 2019-06-21 | 2019-10-01 | 杭州云象网络技术有限公司 | A kind of common recognition method applied to block chain |
| CN110677485A (en) * | 2019-09-30 | 2020-01-10 | 大连理工大学 | Dynamic layered Byzantine fault-tolerant consensus method based on credit |
| CN111682942A (en) * | 2020-05-18 | 2020-09-18 | 哈尔滨工业大学 | Binary weighted Byzantine fault-tolerant consensus method applied to permit chain |
-
2020
- 2020-12-24 CN CN202011551994.8A patent/CN112714177B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108616596A (en) * | 2018-05-09 | 2018-10-02 | 南京邮电大学 | It is adaptively known together method based on the block chain that dynamic authorization and network environment perceive |
| CN110289966A (en) * | 2019-06-19 | 2019-09-27 | 西南交通大学 | Anti-adaptive attack alliance's chain common recognition method based on Byzantine failure tolerance |
| CN110298754A (en) * | 2019-06-21 | 2019-10-01 | 杭州云象网络技术有限公司 | A kind of common recognition method applied to block chain |
| CN110677485A (en) * | 2019-09-30 | 2020-01-10 | 大连理工大学 | Dynamic layered Byzantine fault-tolerant consensus method based on credit |
| CN111682942A (en) * | 2020-05-18 | 2020-09-18 | 哈尔滨工业大学 | Binary weighted Byzantine fault-tolerant consensus method applied to permit chain |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113467919A (en) * | 2021-07-19 | 2021-10-01 | 中国银行股份有限公司 | Process management method, system and storage medium based on block chain |
| CN113467919B (en) * | 2021-07-19 | 2024-02-02 | 中国银行股份有限公司 | Block chain-based flow management method, system and storage medium |
| CN113609229A (en) * | 2021-08-18 | 2021-11-05 | 东北大学 | Rapid log replication method and device in Fabric Block chain |
| CN113609229B (en) * | 2021-08-18 | 2023-10-20 | 东北大学 | Method and device for fast log replication in Fabric block chain |
| CN113837758A (en) * | 2021-09-27 | 2021-12-24 | 深圳前海微众银行股份有限公司 | Consensus method and device for block chain system |
| CN114172659A (en) * | 2021-11-30 | 2022-03-11 | 中国建设银行股份有限公司 | Message transmission method, device, equipment and storage medium in block chain system |
| CN114172659B (en) * | 2021-11-30 | 2024-04-26 | 中国建设银行股份有限公司 | Message transmission method, device, equipment and storage medium in block chain system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112714177B (en) | 2022-11-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112714177B (en) | PBFT improved algorithm with linear message complexity | |
| CN108616596B (en) | Block chain self-adaptive consensus method based on dynamic authorization and network environment perception | |
| CN102823205B (en) | Aggregating data traffic from access domains | |
| EP4016932A1 (en) | Evpn and vpls coexistence method, apparatus, and system | |
| EP2911355B1 (en) | Method and device for flow path negotiation in link aggregation group | |
| US20140233563A1 (en) | Multicast processing method and device | |
| WO2014090083A1 (en) | Service bearing method and apparatus during distributed resilient network interconnect | |
| CN106921527B (en) | The processing method and processing device of stacking conflict | |
| US20160072641A1 (en) | Data transmission method, apparatus, and computer storage medium | |
| Xu et al. | SIoTFog: Byzantine-resilient IoT fog networking | |
| CN114050904B (en) | Consensus system and method based on two-level leader node fragmentation structure | |
| US9553760B2 (en) | Method, device, and system for dual-uplink tangent ring convergence | |
| US10243754B2 (en) | Protocol independent multicast designated router notify delay feature | |
| RU2611990C1 (en) | Method for group transmission of packets via software-configurable networks | |
| WO2014059873A1 (en) | Method and device for flow path negotiation in link aggregation group | |
| Mocito et al. | Run-time switching between total order algorithms | |
| US20080019264A1 (en) | System and method for maintaining state synchronization in redundant IMA group protection switching | |
| Li et al. | Concurrent maintenance of rings | |
| CN106330645B (en) | Method and device for fast convergence of Ethernet ring multicast Proxy mode service | |
| Knockel et al. | Self-healing of Byzantine faults | |
| CN112153686B (en) | Service self-networking method based on service discovery data synchronization | |
| CN111082972B (en) | Method for realizing elastic expansion based on distributed cluster and distributed cluster architecture | |
| CN113596115A (en) | Network for realizing multi-node high-performance protocol based on PBFT optimization | |
| CN113572685A (en) | Information reporting method, information processing method, device and equipment | |
| CN111526045A (en) | Fault processing method and system for block chain |
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 |