Bibliographic Details
| Title: |
Toward Verification of DAG-Based Distributed Ledger Technologies through Discrete-Event Simulation. |
| Authors: |
Khan, Misbah1 (AUTHOR) misbah.khan@unsw.edu.au, Hartog, Frank den1 (AUTHOR), Hu, Jiankun1 (AUTHOR) j.hu@adfa.edu.au |
| Source: |
Sensors (14248220). Mar2024, Vol. 24 Issue 5, p1583. 20p. |
| Subject Terms: |
*DISCRETE event simulation, *POISSON processes, *DIRECTED acyclic graphs, *RANDOM walks, *BLOCKCHAINS, *PYTHON programming language |
| Abstract: |
As the potential of directed acyclic graph (DAG)-based distributed ledgers in IoT systems unfolds, a need arises to understand their intricate dynamics in real-world scenarios. It is well known that discrete event simulations can provide high-fidelity evaluations of protocols. However, there is a lack of public discrete event simulators capable of assessing DAG-based distributed ledgers. In this paper, a discrete-event-based distributed ledger simulator is introduced, with which we investigate a custom Python-based implementation of IOTA's Tangle DAG protocol. The study reveals the dynamics of Tangle (particularly Poisson processes in transaction dynamics), the efficiency and intricacies of the random walk in Tangle, and the quantitative assessment of node convergence. Furthermore, the research underscores the significance of weight updates without depth limitations and provides insights into the role, challenges, and implications of the coordinator/validator in DAG architectures. The results are striking, and although the findings are reported only for Tangle, they demonstrate the need for adaptable and versatile discrete event simulators for DAG architectures and tip selection methodologies in general. [ABSTRACT FROM AUTHOR] |
|
Copyright of Sensors (14248220) is the property of MDPI and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Complete |
|
Full text is not displayed to guests. |
Login for full access.
|
