Empirically comparing the performance of blockchain's consensus algorithms. Issue 1 (13th May 2021)

• Record Type: Journal Article
• Authors: Ahmad, Ashar; Alabduljabbar, Abdulrahman; Saad, Muhammad; Nyang, DaeHun; Kim, Joongheon; Mohaisen, David
• Is Part Of: IET blockchain. Volume 1:Issue 1(2021)
• Page Start: 56
• Page End: 64
• Publication Date: 2021-05-13
• Subjects: Protocols -- Protocols -- Software engineering techniques -- Software performance evaluation -- Data security -- Financial computing; Blockchains (Databases) -- Periodicals; Blockchains (Databases); Periodicals; 005.74
• DOI: 10.1049/blc2.12007
• Languages: English
• ISSNs: 2634-1573

Abstract

Abstract: Blockchain‐based audit systems suffer from low scalability and high message complexity. The root cause of these shortcomings is the use of "Practical Byzantine Fault Tolerance" (PBFT) consensus protocol in those systems. Alternatives to PBFT have not been used in blockchain‐based audit systems due to the limited knowledge about their functional and operational requirements. Currently, no blockchain testbed supports the execution and benchmarking of different consensus protocols in a unified testing environment. This paper demonstrates building a blockchain testbed that supports the execution of five state‐of‐the‐art consensus protocols in a blockchain system; namely PBFT, Proof‐of‐Work (PoW), Proof‐of‐Stake (PoS), Proof‐of‐Elapsed Time (PoET), and Clique. Performance evaluation of those consensus algorithms is carried out using data from a real‐world audit system. These results show that the Clique protocol is best suited for blockchain‐based audit systems, based on scalability features.