Performance Modeling of PBFT Consensus Process for Permissioned Blockchain Network (Hyperledger Fabric)

While Blockchain network brings tremendous benefits, there are concerns whether their performance would match up with the mainstream IT systems. This paper aims to investigate whether the consensus process using Practical Byzantine Fault Tolerance (PBFT) could be a performance bottleneck for network...

Full description

Saved in:
Bibliographic Details
Published in2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) pp. 253 - 255
Main Authors Sukhwani, Harish, Martinez, Jose M., Xiaolin Chang, Trivedi, Kishor S., Rindos, Andy
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2017
Subjects
Bitcoin
blockchain
Computational modeling
Fabrics
Fault tolerance
hyperledger fabric
PBFT
performance modeling
Protocols
Stochastic processes
Stochastic Reward Nets
Online AccessGet full text
DOI10.1109/SRDS.2017.36

Cover

More Information
Summary:While Blockchain network brings tremendous benefits, there are concerns whether their performance would match up with the mainstream IT systems. This paper aims to investigate whether the consensus process using Practical Byzantine Fault Tolerance (PBFT) could be a performance bottleneck for networks with a large number of peers. We model the PBFT consensus process using Stochastic Reward Nets (SRN) to compute the mean time to complete consensus for networks up to 100 peers. We create a blockchain network using IBM Bluemix service, running a production-grade IoT application and use the data to parameterize and validate our models. We also conduct sensitivity analysis over a variety of system parameters and examine the performance of larger networks.
DOI:10.1109/SRDS.2017.36