.png){kind=icon}
.png){kind=icon}
Return
An efficient double-layer consensus algorithm based on variable faulty probability model
.png){kind=icon}
OA
AI
DOI：10.1093/jcde/qwaf054.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The consensus algorithm is a key blockchain technology that is used to ensure consistency and reliable consensus without centralized management. However, current consensus algorithms do not fully consider the facts that the faulty probability of nodes is variable in real applications, especially the lower faulty probability in permissioned blockchains. They have excessive communication cost and low throughput in the face of high-performance demand scenarios such as supply chain traceability and the settlement of financial asset transactions. Thus, this paper proposes an efficient double-layer consensus algorithm based on a variable faulty probability model which is Byzantine fault tolerant. It adopts a double-layer structure that incorporates multiple primary nodes to improve scalability and performance. Compared with the multilayer structure, the double-layer structure can dynamically adjust the consensus mechanism more conveniently and flexibly. Furthermore, we select the appropriate grouping strategy and change the number of consensus participants according to the faulty probability distribution of the nodes, so that the consensus process is optimized and the system consensus efficiency is significantly improved. The communication complexity of the proposed algorithm is only the 1.33rd power of the total number of nodes. The experimental results show that our algorithm has a lower communication overhead, higher throughput, and scalability than the state-of-the-art when the node faulty probability is low.
Keywords:
PBFT
variable faulty probability model
double-layer structure
multi-primary nodes
blockchain
Journal
IF:
6.1
Papers:
394
Citations:
3.2K
Organization
View more organizations