Performance Analysis for DAG-based Blockchain Systems Based on the Markov Process
Xingshuo Song , Shiyong Li , Yanxia Chang , Chi Zhang , Quanlin Li
Journal of Systems Science and Systems Engineering ›› 2025, Vol. 34 ›› Issue (1) : 29 -54.
Performance Analysis for DAG-based Blockchain Systems Based on the Markov Process
As an innovative approach, Direct Acyclic Graph (DAG)-based blockchain is designed to overcome the scalability and performance limitations of traditional blockchain systems, which rely on sequential structures. The graph-based architecture of DAG allows for faster transactions and parallel processing, making it a compelling option across various industries. To enhance the analytical understanding of DAG-based blockchains, this paper begins by introducing a Markov model tailored for a DAG-based blockchain system, specifically focusing on the Tangle structure and the interaction between tips and newly arrived transactions. We then establish a continuous-time Markov process to analyze the DAG-based blockchain, demonstrating that this process is a level-dependent quasi-birth-and-death (QBD) process. We further prove that the QBD process is both irreducible and positively recurrent. Building on this foundation, we conduct a performance analysis of the DAG-based blockchain system by deriving the stationary probability vector of the QBD process. Notably, we introduce a novel method to calculate the average sojourn time of any arriving internal tip within the system using first passage times and Phase-type (PH) distributions. Finally, numerical examples are provided to validate our theoretical findings and to illustrate the influence of system parameters on the performance metrics.
An erratum to this article is available online at https://doi.org/10.1007/s11518-025-5676-6.
An erratum to this article is available online at https://doi.org/10.1007/s11518-025-5676-6.
Blockchain / direct acyclic graph (DAG) / QBD process / performance analysis / sojourn time
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
Choi S M, Park J, Nguyen Q, Cronje A (2018). Fantom: A scalable framework for asynchronous distributed systems. arXiv preprint. arXiv:1810.10360: 1–37. |
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
|
| [40] |
|
| [41] |
|
| [42] |
|
| [43] |
|
| [44] |
|
| [45] |
|
| [46] |
|
| [47] |
|
| [48] |
|
| [49] |
|
| [50] |
|
| [51] |
|
| [52] |
|
| [53] |
|
| [54] |
|
| [55] |
|
| [56] |
|
| [57] |
|
| [58] |
|
| [59] |
|
| [60] |
|
| [61] |
|
| [62] |
|
| [63] |
|
| [64] |
|
| [65] |
|
| [66] |
|
| [67] |
|
| [68] |
|
| [69] |
|
Systems Engineering Society of China and Springer-Verlag GmbH Germany
/
| 〈 |
|
〉 |