Performance Modeling of Blockchains of BFT-type Consensus

As the requirements of different application scenarios vary, numerous blockchains have been developed. Among them, chains using Byzantine Fault Tolerance consensus (BFT chains for short) occupy a dominant position. Performance modeling is the most common method for guiding chain design and configuration. However, many lack specific models due to the large number of BFT chains. Providing a general framework for them is promising and should demonstrate two important features that BFT chains may differ in: different consensus stages and different packaging rules. This paper is the first to propose a general framework applicable to various BFT chains. We use the bulk-service model in queuing theory to reflect the above two features of various BFT chains and provide calculation methods for them. We give an expression for the confirmation delay of transactions (TXs for short) in the chain and verify it through experiments on various BFT chains. We also use the model for a brief analysis to assist designers in configuring and designing BFT chains.