Table of Content

Open Access iconOpen Access

ARTICLE

crossmark

Blockchain Queuing Model with Non-Preemptive Limited-Priority

Tianmu Li1,2, Yongjun Ren1,2,*, Jinyue Xia3

1 School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing, 210044, China
2 Engineering Research Center of Digital Forensics, Ministry of Education, Nanjing, 210044, China
3 International Business Machines Corporation (IBM), 12601, USA

* Corresponding Author: Yongjun Ren. Email: email

Intelligent Automation & Soft Computing 2020, 26(5), 1111-1122. https://doi.org/10.32604/iasc.2020.012531

Abstract

Blockchain technology has recently obtained widespread attention. And it is being regarded as potentially even more disruptive than the Internet, whose usage includes large areas of applications ranging from crypto currency, financial services, reputation system, Internet of Things, sharing economy to public and social services. The existing works of blockchain primarily are focused on key components and potential applications. However, in the existing blockchain systems, the waiting time of transactions is too long. Furthermore, it may produce serious consequences because many important transactions are not handled timely. To solve the problem, in the paper, the blockchain Queuing model with non-preemptive limited-priority is established, which considers the different transactions having different priority when being mined. There are two classes of transactions in the model, one is high-priority transaction with pay or with prior interest, the other is low-priority transaction without pay or without prior interest. And high-priority transactions can be mined preferentially when mining process is not occupied. If low-priority transaction is being mined, the arriving high-priority transaction will wait for the mining accomplishment. Through the analysis of the model, we compute average waiting time, average staying time and average length of queue. From simulation of the model, we find that transactions with pay or with prior interest and increase service rate of mining are effective for reducing waiting time. Besides, the two factors mutually reinforce to shorten waiting time. Finally, we conclude this paper and point out the direction of future research.

Keywords


Cite This Article

APA Style
Li, T., Ren, Y., Xia, J. (2020). Blockchain queuing model with non-preemptive limited-priority. Intelligent Automation & Soft Computing, 26(5), 1111-1122. https://doi.org/10.32604/iasc.2020.012531
Vancouver Style
Li T, Ren Y, Xia J. Blockchain queuing model with non-preemptive limited-priority. Intell Automat Soft Comput . 2020;26(5):1111-1122 https://doi.org/10.32604/iasc.2020.012531
IEEE Style
T. Li, Y. Ren, and J. Xia "Blockchain Queuing Model with Non-Preemptive Limited-Priority," Intell. Automat. Soft Comput. , vol. 26, no. 5, pp. 1111-1122. 2020. https://doi.org/10.32604/iasc.2020.012531

Citations




cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1469

    View

  • 1103

    Download

  • 1

    Like

Share Link