对基于固定批处理的排队辅助区块链系统分析方法的借鉴

V. Goswami, B. B. Dash, S. Tripathy, Barun Bikram Dash, S. Patra, Rabindra Kumar Barik
{"title":"对基于固定批处理的排队辅助区块链系统分析方法的借鉴","authors":"V. Goswami, B. B. Dash, S. Tripathy, Barun Bikram Dash, S. Patra, Rabindra Kumar Barik","doi":"10.1145/3549206.3549247","DOIUrl":null,"url":null,"abstract":"Bitcoin is a virtual cryptocurrency built on the blockchain, a transaction-ledger database. The blockchain is updated and maintained by a miner passing through a mining process in which a group of miners competes to solve a tough puzzle-like challenge. Users’ transactions are grouped into blocks, and when an algorithmic problem specialized for the block is solved, the block is recorded to the blockchain. According to a recent study, newly arrived transactions are not included in the block being mined and waits in the unconfirmed transaction pool and mined by a miner till the number of transaction matches a minimum batch size i.e. the block size limit. The transaction-confirmation time is investigated in this paper by simulating the mining process using a queueing system with batch service. We assume a Markovian queue that processes transactions in fixed batch K. Additionally, we evaluate the model’s performance metrics, such as the estimated number of transactions seeking to enter the block from the queue, the mean number of transactions waiting in the unconfirmed transaction pool, the waiting time for a transaction, and the confirmation time for every transaction. The validation of the analytical model was performed utilizing the software packages MAPLE 18 to analyze the conclusions acquired by the queueing model.","PeriodicalId":199675,"journal":{"name":"Proceedings of the 2022 Fourteenth International Conference on Contemporary Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Leveraging Towards Analytical Approach of Fixed batch-based Queueing assisted Blockchain System\",\"authors\":\"V. Goswami, B. B. Dash, S. Tripathy, Barun Bikram Dash, S. Patra, Rabindra Kumar Barik\",\"doi\":\"10.1145/3549206.3549247\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Bitcoin is a virtual cryptocurrency built on the blockchain, a transaction-ledger database. The blockchain is updated and maintained by a miner passing through a mining process in which a group of miners competes to solve a tough puzzle-like challenge. Users’ transactions are grouped into blocks, and when an algorithmic problem specialized for the block is solved, the block is recorded to the blockchain. According to a recent study, newly arrived transactions are not included in the block being mined and waits in the unconfirmed transaction pool and mined by a miner till the number of transaction matches a minimum batch size i.e. the block size limit. The transaction-confirmation time is investigated in this paper by simulating the mining process using a queueing system with batch service. We assume a Markovian queue that processes transactions in fixed batch K. Additionally, we evaluate the model’s performance metrics, such as the estimated number of transactions seeking to enter the block from the queue, the mean number of transactions waiting in the unconfirmed transaction pool, the waiting time for a transaction, and the confirmation time for every transaction. The validation of the analytical model was performed utilizing the software packages MAPLE 18 to analyze the conclusions acquired by the queueing model.\",\"PeriodicalId\":199675,\"journal\":{\"name\":\"Proceedings of the 2022 Fourteenth International Conference on Contemporary Computing\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2022 Fourteenth International Conference on Contemporary Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3549206.3549247\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2022 Fourteenth International Conference on Contemporary Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3549206.3549247","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

比特币是一种建立在区块链(一个交易分类数据库)上的虚拟加密货币。区块链由一名矿工更新和维护,在这个过程中,一群矿工竞争解决一个艰难的谜题式挑战。用户的交易被分组到块中,当专门针对该块的算法问题得到解决时,该块被记录到区块链。根据最近的一项研究,新到达的交易不包括在正在挖掘的区块中,并在未经确认的交易池中等待,由矿工挖掘,直到交易数量匹配最小批大小,即区块大小限制。本文利用具有批处理服务的排队系统模拟挖掘过程,研究了交易确认时间。我们假设一个马尔可夫队列处理固定批k中的事务。此外,我们评估模型的性能指标,例如寻求从队列进入块的事务的估计数量,在未确认的事务池中等待的事务的平均数量,事务的等待时间以及每个事务的确认时间。利用MAPLE 18软件包对排队模型得出的结论进行分析,对分析模型进行验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Leveraging Towards Analytical Approach of Fixed batch-based Queueing assisted Blockchain System
Bitcoin is a virtual cryptocurrency built on the blockchain, a transaction-ledger database. The blockchain is updated and maintained by a miner passing through a mining process in which a group of miners competes to solve a tough puzzle-like challenge. Users’ transactions are grouped into blocks, and when an algorithmic problem specialized for the block is solved, the block is recorded to the blockchain. According to a recent study, newly arrived transactions are not included in the block being mined and waits in the unconfirmed transaction pool and mined by a miner till the number of transaction matches a minimum batch size i.e. the block size limit. The transaction-confirmation time is investigated in this paper by simulating the mining process using a queueing system with batch service. We assume a Markovian queue that processes transactions in fixed batch K. Additionally, we evaluate the model’s performance metrics, such as the estimated number of transactions seeking to enter the block from the queue, the mean number of transactions waiting in the unconfirmed transaction pool, the waiting time for a transaction, and the confirmation time for every transaction. The validation of the analytical model was performed utilizing the software packages MAPLE 18 to analyze the conclusions acquired by the queueing model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信