EBMICQL: Improving Efficiency of Blockchain Miner Pools via Incremental and Continuous Q-Learning Framework

IF 0.8 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Mona Mulchandani, P. Nair
{"title":"EBMICQL: Improving Efficiency of Blockchain Miner Pools via Incremental and Continuous Q-Learning Framework","authors":"Mona Mulchandani, P. Nair","doi":"10.1142/s0219467824500347","DOIUrl":null,"url":null,"abstract":"Blockchain mining pools assist in reducing computational load on individual miner nodes via distributing mining tasks. This distribution must be done in a non-redundant manner, so that each miner is able to calculate block hashes with optimum efficiency. To perform this task, a wide variety of mining optimization methods are proposed by researchers, and most of them distribute mining tasks via statistical request processing models. These models segregate mining requests into non-redundant sets, each of which will be processed by individual miners. But this division of requests follows a static procedure, and does not consider miner specific parameters for set creation, due to which overall efficiency of the underlying model is limited, which reduces its mining performance under real-time scenarios. To overcome this issue, an Incremental & Continuous Q-Learning Framework for generation of miner-specific task groups is proposed in this text. The model initially uses a Genetic Algorithm (GA) method to improve individual miner performance, and then applies Q-Learning to individual mining requests. The Reason for selecting GA model is that it assists in maintaining better speed-to-power (S2P) ratio by optimization of miner resources that are utilized during computations. While, the reason for selecting Q-Learning Model is that it is able to continuously identify miners performance, and create performance-based mining pools at a per-miner level. Due to application of Q-Learning, the model is able to assign capability specific mining tasks to individual miner nodes. Because of this capability-driven approach, the model is able to maximize efficiency of mining, while maintaining its QoS performance. The model was tested on different consensus methods including Practical Byzantine Fault Tolerance Algorithm (PBFT), Proof-of-Work (PoW), Proof-of-Stake (PoS), and Delegated PoS (DPoS), and its performance was evaluated in terms of mining delay, miner efficiency, number of redundant calculations per miner, and energy efficiency for mining nodes. It was observed that the proposed GA based Q-Learning Model was able to reduce mining delay by 4.9%, improve miners efficiency by 7.4%, reduce number of redundant computations by 3.5%, and reduce energy required for mining by 7.1% when compared with various state-of-the-art mining optimization techniques. Similar performance improvement was observed when the model was applied on different blockchain deployments, thus indicating better scalability and deployment capability for multiple application scenarios.","PeriodicalId":44688,"journal":{"name":"International Journal of Image and Graphics","volume":" ","pages":""},"PeriodicalIF":0.8000,"publicationDate":"2023-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Image and Graphics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219467824500347","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Blockchain mining pools assist in reducing computational load on individual miner nodes via distributing mining tasks. This distribution must be done in a non-redundant manner, so that each miner is able to calculate block hashes with optimum efficiency. To perform this task, a wide variety of mining optimization methods are proposed by researchers, and most of them distribute mining tasks via statistical request processing models. These models segregate mining requests into non-redundant sets, each of which will be processed by individual miners. But this division of requests follows a static procedure, and does not consider miner specific parameters for set creation, due to which overall efficiency of the underlying model is limited, which reduces its mining performance under real-time scenarios. To overcome this issue, an Incremental & Continuous Q-Learning Framework for generation of miner-specific task groups is proposed in this text. The model initially uses a Genetic Algorithm (GA) method to improve individual miner performance, and then applies Q-Learning to individual mining requests. The Reason for selecting GA model is that it assists in maintaining better speed-to-power (S2P) ratio by optimization of miner resources that are utilized during computations. While, the reason for selecting Q-Learning Model is that it is able to continuously identify miners performance, and create performance-based mining pools at a per-miner level. Due to application of Q-Learning, the model is able to assign capability specific mining tasks to individual miner nodes. Because of this capability-driven approach, the model is able to maximize efficiency of mining, while maintaining its QoS performance. The model was tested on different consensus methods including Practical Byzantine Fault Tolerance Algorithm (PBFT), Proof-of-Work (PoW), Proof-of-Stake (PoS), and Delegated PoS (DPoS), and its performance was evaluated in terms of mining delay, miner efficiency, number of redundant calculations per miner, and energy efficiency for mining nodes. It was observed that the proposed GA based Q-Learning Model was able to reduce mining delay by 4.9%, improve miners efficiency by 7.4%, reduce number of redundant computations by 3.5%, and reduce energy required for mining by 7.1% when compared with various state-of-the-art mining optimization techniques. Similar performance improvement was observed when the model was applied on different blockchain deployments, thus indicating better scalability and deployment capability for multiple application scenarios.
EBMICQL:通过增量和连续Q学习框架提高区块链矿工池的效率
区块链挖矿池有助于通过分布式挖矿任务来减少单个矿工节点的计算负载。这种分发必须以非冗余的方式进行,这样每个矿工都能够以最佳效率计算块哈希。为了执行这项任务,研究人员提出了各种各样的挖掘优化方法,其中大多数通过统计请求处理模型来分配挖掘任务。这些模型将挖掘请求分离为非冗余集合,每个集合将由单个矿工处理。但这种请求划分遵循静态过程,并且不考虑用于集创建的矿工特定参数,因此底层模型的总体效率有限,这降低了其在实时场景下的挖掘性能。为了克服这个问题,本文提出了一个用于生成矿工特定任务组的增量和连续Q学习框架。该模型最初使用遗传算法(GA)方法来提高个体矿工的性能,然后将Q学习应用于个体挖掘请求。选择GA模型的原因是,它通过优化计算过程中使用的矿工资源,有助于保持更好的速度功率比(S2P)。而选择Q-Learning模型的原因是,它能够持续识别矿工的表现,并在每个矿工的水平上创建基于表现的矿池。由于Q学习的应用,该模型能够将特定于能力的挖掘任务分配给各个矿工节点。由于这种能力驱动的方法,该模型能够最大限度地提高挖掘效率,同时保持其QoS性能。该模型在不同的一致性方法上进行了测试,包括实用拜占庭容错算法(PBFT)、工作量证明(PoW)、权益证明(PoS)和委托PoS(DPoS),并从挖掘延迟、矿工效率、每个矿工的冗余计算次数和挖掘节点的能量效率等方面对其性能进行了评估。研究表明,与各种最先进的采矿优化技术相比,所提出的基于GA的Q学习模型能够将采矿延迟减少4.9%,矿工效率提高7.4%,冗余计算次数减少3.5%,采矿所需能量减少7.1%。当该模型应用于不同的区块链部署时,也观察到了类似的性能改进,从而表明在多个应用场景中具有更好的可扩展性和部署能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Image and Graphics
International Journal of Image and Graphics COMPUTER SCIENCE, SOFTWARE ENGINEERING-
CiteScore
2.40
自引率
18.80%
发文量
67
×
引用
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学术官方微信