TY - GEN
T1 - Proteus
T2 - 2nd IEEE International Conference on Blockchain, Blockchain 2019
AU - Jalalzai, Mohammad M.
AU - Busch, Costas
AU - Richard, Golden G.
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/7
Y1 - 2019/7
N2 - Byzantine Fault Tolerant (BFT) consensus exhibits higher throughput in comparison to Proof of Work (PoW) in blockchains. However, BFT-based protocols suffer from scalability problems with respect to the number of replicas in the network due to their inherent quadratic message complexity. Previously, proposed solutions improve BFT performance for normal operation, but will fall back to quadratic message complexity once the protocol observes a certain number of failures. To address this issue we propose Proteus, a new BFT-based consensus protocol which elects a subset of nodes c as a root committee. Proteus guarantees stable performance, regardless of the number of failures in the network and it improves on the quadratic message complexity of typical BFT-based protocols to O(cn) messages, where c << n, for large number of nodes n. We tested our protocol on 200 Amazon EC2 instances, with two different baseline BFT protocols (PBFT and Bchain) for comparison. In these tests, our protocol outperformed the baselines by more than 2× in terms of throughput as well as latency.
AB - Byzantine Fault Tolerant (BFT) consensus exhibits higher throughput in comparison to Proof of Work (PoW) in blockchains. However, BFT-based protocols suffer from scalability problems with respect to the number of replicas in the network due to their inherent quadratic message complexity. Previously, proposed solutions improve BFT performance for normal operation, but will fall back to quadratic message complexity once the protocol observes a certain number of failures. To address this issue we propose Proteus, a new BFT-based consensus protocol which elects a subset of nodes c as a root committee. Proteus guarantees stable performance, regardless of the number of failures in the network and it improves on the quadratic message complexity of typical BFT-based protocols to O(cn) messages, where c << n, for large number of nodes n. We tested our protocol on 200 Amazon EC2 instances, with two different baseline BFT protocols (PBFT and Bchain) for comparison. In these tests, our protocol outperformed the baselines by more than 2× in terms of throughput as well as latency.
KW - BFT
KW - Blockchain
KW - Byzantine
KW - Consensus
KW - Scalability
UR - http://www.scopus.com/inward/record.url?scp=85078698786&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85078698786&partnerID=8YFLogxK
U2 - 10.1109/Blockchain.2019.00048
DO - 10.1109/Blockchain.2019.00048
M3 - Conference contribution
AN - SCOPUS:85078698786
T3 - Proceedings - 2019 2nd IEEE International Conference on Blockchain, Blockchain 2019
SP - 308
EP - 313
BT - Proceedings - 2019 2nd IEEE International Conference on Blockchain, Blockchain 2019
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 14 July 2019 through 17 July 2019
ER -