Toward Low-Cost and Stable Blockchain Networks
Toward Low-Cost and Stable Blockchain Networks
复制标题
DOI：
10.1109/icc40277.2020.9148615
复制
发表时间：
2020-02
期刊：
影响因子：
--
通讯作者：
Minghong Fang;Jia Liu
中科院分区：
文献类型：
--
作者：
Minghong Fang;Jia Liu
区块链网络被认为是安全分布式系统的未来，近年来受到了工业界和学术界越来越多的关注。然而，区块链挖矿过程需要高昂的硬件成本，并且消耗大量的能源（研究表明，比特币挖矿消耗的能源几乎与爱尔兰的用电量相同）。为了解决区块链网络的高挖矿成本问题，本文提出了一种区块链挖矿资源分配算法，以降低基于pow（工作量证明）的区块链网络的挖矿成本。首先提出了一般区块链网络的解析排队模型。在我们的排队模型中，事务随机到达队列并以批处理的方式进行服务，其服务率概率分布未知，且不受任何优先级机制的影响。然后，我们利用Lyapunov优化技术提出了一种动态采矿资源分配算法（DMRA），该算法由调优参数K \gt 0$参数化。我们证明了我们的算法实现了$[O(1/ K)，O(K)]$ cost-optimality-gap-vs-delay的权衡。我们的模拟结果也证明了DMRA在降低采矿成本方面的有效性。
Envisioned to be the future of secured distributed systems, blockchain networks have received increasing attention from both the industry and academia in recent years. However, blockchain mining processes demand high hardware costs and consume a vast amount of energy (studies have shown that the amount of energy consumed in Bitcoin mining is almost the same as the electricity used in Ireland). To address the high mining cost problem of blockchain networks, in this paper, we propose a blockchain mining resources allocation algorithm to reduce the mining cost in PoW-based (proof-of-work-based) blockchain networks. We first propose an analytical queueing model for general blockchain networks. In our queueing model, transactions arrive randomly to the queue and are served in a batch manner with unknown service rate probability distribution and agnostic to any priority mechanism. Then, we leverage the Lyapunov optimization techniques to propose a dynamic mining resources allocation algorithm (DMRA), which is parameterized by a tuning parameter $K \gt 0$. We show that our algorithm achieves an $[O(1/ K),O(K)]$ cost-optimality-gap-vs-delay tradeoff. Our simulation results also demonstrate the effectiveness of DMRA in reducing mining costs.