Priority queueing analysis of transaction-confirmation time for bitcoin

19Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In Bitcoin system, a transaction is given a priority value according to its attributes such as the remittance amount and fee, and transactions with high priorities are likely to be confirmed faster than those with low priorities. In this paper, we analyze the transaction-confirmation time for Bitcoin system. We model the transaction-confirmation process as a queueing system with batch service, M/GB/1. We consider the joint distribution of numbers of transactions in system and the elapsed service time, deriving the mean transaction-confirmation time. Using the result, we derive the recursive formulae of mean transaction-confirmation times of an M/GB/1 queue with priority service discipline. In numerical examples, we show the eect of the maximum block size on the mean transaction-confirmation time, investigating the accuracy region of our queueing model. We also discuss how the increase in micropayments, which are likely to be given low priorities, aects the transaction-confirmation time.

Cite

CITATION STYLE

APA

Kawase, Y., & Kasahara, S. (2020). Priority queueing analysis of transaction-confirmation time for bitcoin. Journal of Industrial and Management Optimization, 16(3), 1077–1098. https://doi.org/10.3934/JIMO.2018193

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free