Modelling of blockchain based queuing theory implementing preemptive and non-preemptive algorithms

Meenakshi Kandpal (), Niharika Keshari (), Amrendra Singh Yadav (), Mohit Yadav () and Rabindra Kumar Barik ()
Additional contact information
Meenakshi Kandpal: KIIT Deemed to Be University
Niharika Keshari: MNNIT Allahabad
Amrendra Singh Yadav: ABV-Indian Institute of Information Technology and Management
Mohit Yadav: Malaviya National Institute of Technology
Rabindra Kumar Barik: KIIT Deemed to Be University

International Journal of System Assurance Engineering and Management, 2024, vol. 15, issue 6, No 43, 2554-2570

Abstract: Abstract Blockchain is one of the leading technologies, and it has already begun to transform several industries and areas, including banking, business, healthcare, smart homes, and the Internet of Things. Its benefits include a decentralized network, robustness, availability, stability, anonymity, audibility, and accountability. As Blockchain applications proliferate, it becomes clear that most of the effort is focused on their engineering implementation. However, there has yet to be much focus on the theoretical side. This paper simulated the mining process in Blockchain-based systems using queuing theory. In order to simulate Bitcoin, one of the most well-known cryptocurrencies, we used actual data from Bitcoin and JSIMgraph’s M/M/n/L queuing system. We used genuine Bitcoin data and JSIMgraph’s M/M/n/L queuing system to replicate Bitcoin, one of the most well-known cryptocurrencies. We produced realistic results that are applicable and will pave the way for future theoretical research on Blockchain-based Queuing systems. Our study implemented both non-preemptive algorithms (such as First Come First Serve, Longest Job First, Shortest Job First, and Last Come First Serve) and preemptive algorithms (such as Round Robin). Further, the average queue waiting time of transactions under these algorithms is also compared.

Keywords: Queuing; Preemptive; Non-preemptive; First Come First Serve; Last Come First Serve; Round Robin; Shortest Job First; Longest Job First (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13198-024-02276-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:ijsaem:v:15:y:2024:i:6:d:10.1007_s13198-024-02276-0

Ordering information: This journal article can be ordered from
http://www.springer.com/engineering/journal/13198

DOI: 10.1007/s13198-024-02276-0

Access Statistics for this article

International Journal of System Assurance Engineering and Management is currently edited by P.K. Kapur, A.K. Verma and U. Kumar

More articles in International Journal of System Assurance Engineering and Management from Springer, The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().