Can Byzantine Fault Tolerant Consensus Agreement be Utilitarian, Scalable and Resilient? An Algorithm Proposition from a Consortium Blockchain Perspective: CUBA
Preprint
Abstract
Byzantine Fault Tolerant (BFT) Algorithms have been utilized in distributed systems or blockchains for solving consensus problemsby being reliable, consistent, and ensuring availability. However, in the case of consortium blockchains where the network is moreaccountable with limited participation, there is a need to modify the BFT algorithms while ensuring the existing advantages butimproving upon its scalability and fault tolerance. So in this scenario, we analyze the BFT consensus algorithms performance froma mobility consortium blockchain perspective for data certification and data monetization use cases. We identify the challenges ofmessage complexity and security in the algorithm through this implementation and propose an improved algorithm CUBA (CompetitiveUtilitarian Byzantine Agreement). It achieves better scalability compared to PBFT, IBFT, and QBFT algorithm variants of BFT andremains comparable to Clique. CUBA uses parallelization, reduced communication complexity through quorums, utilitarian actionmeasures, and network evolution to render the system secure and performant. It is analyzed from a performance and a security pointof view to test its resilience against benign or non-benign failures.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- An analysis of energy consumption and carbon footprints of cryptocurrencies and possible solutionsDigital Communications and Networks, 2023
- Towards blockchain-IoT based shared mobility: Car-sharing and leasing as a case studyJournal of Network and Computer Applications, 2022
- Review on Consensus Protocols for Blockchain2021
- A multi-layered blockchain framework for smart mobility data-marketsTransportation Research Part C: Emerging Technologies, 2020
- Collaboration as a service (CaaS) to fully integrate public transportation – Lessons from long distance travel to reimagine mobility as a serviceTransportation Research Part A: Policy and Practice, 2020
- Secure High-Rate Transaction Processing in Bitcoin2015
- How to build a highly available system using consensus1996
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982