Comparison of transaction processing speed in distributed ledger and directed acyclic graph

Бесплатный доступ

This paper provides a comparative analysis of the transaction processing speed in distributed registry technologies and directed acyclic graph. The queuing theory is used to calculate the value of the average transaction processing time.

Directed acyclic graph, distributed registry technologies, transactions, queuing system, average transaction processing time, throughput

Короткий адрес: https://sciup.org/148326866

IDR: 148326866   |   DOI: 10.18137/RNU.V9187.23.03.P.75

Статья научная