Analysis of Dynamic Transaction Fee Blockchain Using Queueing Theory

In recent years, blockchains have been attracting attention because they are decentralized networks with transparency and trustworthiness. Generally, transactions on blockchain networks with higher transaction fees are processed preferentially compared to others. The processing fee varies significantly depending on other transactions; it is difficult to predict the fee, and it may be significantly high. These are major barriers to blockchain utilization. Although several consensus algorithms have been proposed to solve these problems, their performance has not been fully evaluated. In this study, we model a blockchain system with a base fee, such as in Ethereum, via a priority queueing model. To assess the model’s performance, we derive the stability condition, stationary probability, average number of customers, and average waiting time for each type of customer. In deriving the stability conditions, we propose a method that uses the theoretical values of the partial models. These theoretical values match well with those obtained from Monte Carlo simulations, confirming the validity of the analysis.