当前位置: X-MOL 学术Inf. Process. Manag. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Enhancing the efficiency and scalability of blockchain through probabilistic verification and clustering
Information Processing & Management ( IF 7.4 ) Pub Date : 2021-06-29 , DOI: 10.1016/j.ipm.2021.102650
Mengya Li , Yang Qin , Bing Liu , Xiaowen Chu

Blockchain is a disruptive technique that finds many applications in FinTech, IoT, and token economy. Because of the asynchrony, the competitive mining, and the indeterministic block propagation delay in networks, forks in the blockchain occur frequently, which not only waste a lot of computing resources but also result in potential security issues. This issue will greatly affect the efficiency of blockchain networks. In the meantime, when blockchain networks expand, the storage data for each node will be increasing dramatically. Participates are about to face the problem of storage limitation. Blockchain is hard to scale. This paper introduced PvScheme, a probabilistic verification scheme that could effectively reduce the block propagation delay and reduce the occurrence of blockchain forks. We further enhanced the security of PvScheme to provide reliable block delivery. We also analysed the resistance of PvScheme to fake blocks and double spending attacks. Furthermore, we proposed ICIStrategy, a multi-node collaborative storage strategy based on intra-cluster integrity. In ICIStrategy, we divided all participates into several clusters. Each cluster requires holding all data of the network, whereas a node within the cluster does not need to maintain data integrity. It aims to solve the storage pressure by reducing the amount data that each participate need to store and reduce communication overhead by collaboratively storing and verifying blocks through in-cluster nodes.

We designed the experiments to study the performance of PvScheme and ICIStrategy. The experiment results illustrated that PvScheme could reduce the propagation delay of the standard protocol by 43.1% when the validation degree was 0.5. And we got the best effect when the validation degree is 0.9. It got a relatively lower forks and a relatively higher security at the same time, which achieved a compromise between the efficiency and security in the blockchain. According to the experimental results, ICIStrategy decreased effectively the storage of each node. And the larger the scale of networks, the less the storage of each node.



中文翻译:

通过概率验证和聚类提高区块链的效率和可扩展性

区块链是一种颠覆性技术,在金融科技、物联网和代币经济中有着广泛的应用。由于网络中的异步性、竞争性挖矿以及不确定性的区块传播延迟,区块链中的分叉频繁发生,不仅浪费了大量计算资源,还可能导致潜在的安全问题。这个问题将极大地影响区块链网络的效率。同时,随着区块链网络的扩展,每个节点的存储数据将急剧增加。参与者即将面临存储限制的问题。区块链很难扩展。本文介绍了一种概率验证方案 PvScheme,可以有效降低区块传播延迟,减少区块链分叉的发生。我们进一步增强了 PvScheme 的安全性,以提供可靠的区块交付。我们还分析了 PvScheme 对假区块和双花攻击的抵抗力。此外,我们提出了ICIStrategy,一种基于集群内完整性的多节点协同存储策略。在 ICIStrategy 中,我们将所有参与者分为几个集群。每个集群需要保存网络的所有数据,而集群内的节点不需要维护数据完整性。它旨在通过减少每个参与者需要存储的数据量并通过集群内节点协作存储和验证块来减少通信开销来解决存储压力。基于集群内完整性的多节点协同存储策略 在 ICIStrategy 中,我们将所有参与者分为几个集群。每个集群需要保存网络的所有数据,而集群内的节点不需要维护数据完整性。它旨在通过减少每个参与者需要存储的数据量并通过集群内节点协作存储和验证块来减少通信开销来解决存储压力。基于集群内完整性的多节点协同存储策略 在 ICIStrategy 中,我们将所有参与者分为几个集群。每个集群需要保存网络的所有数据,而集群内的节点不需要维护数据完整性。它旨在通过减少每个参与者需要存储的数据量并通过集群内节点协作存储和验证块来减少通信开销来解决存储压力。

我们设计了实验来研究 PvScheme 和 ICIStrategy 的性能。实验结果表明,当验证度为0.5时,PvScheme可以将标准协议的传播延迟降低43.1%。当验证度为0.9时,我们得到了最好的效果。它同时获得了相对较低的分叉和相对较高的安全性,在区块链中实现了效率和安全性的折衷。根据实验结果,ICIStrategy 有效降低了每个节点的存储量。并且网络规模越大,每个节点的存储量就越少。

更新日期:2021-06-29
down
wechat
bug