TY - GEN
T1 - Window Based BFT Blockchain Consensus
AU - Jalalzai, Mohammad M.
AU - Busch, Costas
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/7
Y1 - 2018/7
N2 - There is surge of interest to the blockchain technology not only in the scientific community but in the business community as well. Proof of Work (PoW) and Byzantine Fault Tolerant (BFT) are the two main classes of consensus protocols that are used in the blockchain consensus layer. PoW is highly scalable but very slow with about 7 (transactions/second) performance. BFT based protocols are highly efficient but their scalability are limited to only tens of nodes. One of the main reasons for the BFT limitation is the quadratic O(n^{2}) communication complexity of BFT based protocols for n nodes that requires n \times n broadcasting. In this paper, we present the Musch protocol which is BFT based and provides communication complexity O(fn+n) for f failures and n nodes, where f < n/3, without compromising the latency. Hence, the performance adjusts to f such that for constant f the communication complexity is linear. Musch achieves this by introducing the notion of exponentially increasing windows of nodes to which complains are reported, instead of broadcasting to all the nodes. To our knowledge, this is the first BFT-based blockchain protocol which efficiently addresses simultaneously the issues of communication complexity and latency under the presence of failures.
AB - There is surge of interest to the blockchain technology not only in the scientific community but in the business community as well. Proof of Work (PoW) and Byzantine Fault Tolerant (BFT) are the two main classes of consensus protocols that are used in the blockchain consensus layer. PoW is highly scalable but very slow with about 7 (transactions/second) performance. BFT based protocols are highly efficient but their scalability are limited to only tens of nodes. One of the main reasons for the BFT limitation is the quadratic O(n^{2}) communication complexity of BFT based protocols for n nodes that requires n \times n broadcasting. In this paper, we present the Musch protocol which is BFT based and provides communication complexity O(fn+n) for f failures and n nodes, where f < n/3, without compromising the latency. Hence, the performance adjusts to f such that for constant f the communication complexity is linear. Musch achieves this by introducing the notion of exponentially increasing windows of nodes to which complains are reported, instead of broadcasting to all the nodes. To our knowledge, this is the first BFT-based blockchain protocol which efficiently addresses simultaneously the issues of communication complexity and latency under the presence of failures.
KW - BFT
KW - blockchain
KW - complexity
KW - consensus
KW - distributed algorithms
KW - distributed systems
UR - http://www.scopus.com/inward/record.url?scp=85067860581&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85067860581&partnerID=8YFLogxK
U2 - 10.1109/Cybermatics_2018.2018.00184
DO - 10.1109/Cybermatics_2018.2018.00184
M3 - Conference contribution
AN - SCOPUS:85067860581
T3 - Proceedings - IEEE 2018 International Congress on Cybermatics: 2018 IEEE Conferences on Internet of Things, Green Computing and Communications, Cyber, Physical and Social Computing, Smart Data, Blockchain, Computer and Information Technology, iThings/GreenCom/CPSCom/SmartData/Blockchain/CIT 2018
SP - 971
EP - 979
BT - Proceedings - IEEE 2018 International Congress on Cybermatics
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 11th IEEE International Congress on Conferences on Internet of Things, 14th IEEE International Conference on Green Computing and Communications, 11th IEEE International Conference on Cyber, Physical and Social Computing, 4th IEEE International Conference on Smart Data, 1st IEEE International Conference on Blockchain and 18th IEEE International Conference on Computer and Information Technology, iThings/GreenCom/CPSCom/SmartData/Blockchain/CIT 2018
Y2 - 30 July 2018 through 3 August 2018
ER -