P-Raft: An Efficient and Robust Consensus Mechanism for Consortium Blockchains
-
Published:2023-05-17
Issue:10
Volume:12
Page:2271
-
ISSN:2079-9292
-
Container-title:Electronics
-
language:en
-
Short-container-title:Electronics
Author:
Lu Shaofei12ORCID, Zhang Xuyang1, Zhao Renke12, Chen Lizhi1, Li Junyi12, Yang Guanzhong12
Affiliation:
1. College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, China 2. Hunan Provincial Key Laboratory of Blockchain Infrastructure and Application, Changsha 410082, China
Abstract
With the rise in blockchain technology, consortium blockchains have garnered increasing attention in practical applications due to their decentralization and immutability. However, the performance of current consortium blockchains remains a significant obstacle to large-scale commercial adoption. The consensus algorithm, as a fundamental component of blockchain technology, plays a critical role in ensuring both security and efficiency. Unfortunately, most existing consensus algorithms for consortium blockchains are vote-based consensus algorithms, and the performance of vote-based consensus algorithms is largely limited by the performance of the leader node. Therefore, we present P-Raft: a high-performance consensus algorithm that builds upon the Raft algorithm and leverages node server performance evaluations. The primary objectives of this article included enhancing the efficiency of Leader processing, promoting the utilization of the consortium blockchain, and ensuring the robustness of Leader election. Specifically designed to meet the service requirements of consortium blockchain’s consensus mechanism, the P-Raft incorporated the Yasa model, which evaluated the instant machine performance of each node. The performance of each node is then associated with the election timeout, ensuring that nodes with superior performance are more likely to be chosen as Leaders. Additionally, we implemented a leader verification mechanism based on the Bohen-Lynn-Shacham (BLS) signature, which prevented malicious Byzantine nodes from becoming Leaders without receiving enough votes. Empirical findings show that the P-Raft can swiftly designate high-performing nodes as Leaders, thereby greatly improving service efficiency in the consensus process and the overall performance of the consensus mechanism. Ultimately, P-Raft is better equipped to meet the demands of consortium blockchain applications for large-scale transactions.
Funder
Special Funds for Construction of Innovative Provinces in Hunan Province of China
Subject
Electrical and Electronic Engineering,Computer Networks and Communications,Hardware and Architecture,Signal Processing,Control and Systems Engineering
Reference14 articles.
1. Research on model of blockchain-enabled power carbon emission trade considering credit scoring mechanism;Cui;Electr. Power Constr.,2019 2. The Byzantine generals problem;Lamport;ACM Trans. Program. Lang. Syst.,1982 3. Zheng, Z., Xie, S., Dai, H., Chen, X., and Wang, H. (2017, January 25–30). An overview of blockchain technology: Architecture, consensus, and future trends. Proceedings of the 2017 IEEE International Congress on Big Data (BigData Congress), Honolulu, HI, USA. 4. Lu, S., Pei, J., Zhao, R., Yu, X., Zhang, X., Li, J., and Yang, G. (2023). CCIO: A Cross-Chain Interoperability Approach for Consortium Blockchains Based on Oracle. Sensors, 23. 5. Guerrero-Sanchez, A.E., Rivas-Araiza, E.A., Gonzalez-Cordoba, J.L., Toledano-Ayala, M., and Takacs, A. (2020). Blockchain Mechanism and Symmetric Encryption in A Wireless Sensor Network. Sensors, 20.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|