.png){kind=icon}
返回
A node selection algorithm with a genetic method based on PBFT in consortium blockchains
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-022-00907-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Industry and research communities have widely studied Blockchain technology, and the consortium blockchain is currently the most used category with a wide range of applications. However, issues, such as the performance of consensus mechanisms, have become essential constraints on promoting and applying the consortium blockchain. To improve the performance of the consortium blockchain consensus, we use the practical Byzantine fault tolerance (PBFT) consensus widely used in consortium blockchains to reduce the number of consensus nodes to optimize performance. Using the PBFT consensus, we screen high-performance nodes and obtain a reliable and limited number of consensus nodes. We propose a genetic algorithm-based blockchain consensus algorithm improvement scheme, design the fitness function of blockchain nodes and the genetic algorithm to iterate out consensus node groups with excellent indicators continuously, and finally iterate the nodes participating in the consensus. This algorithm can increase the speed and efficiency of the consensus, block generation, and computation. The algorithm in this article is tested on the FISCO BCOS (i.e., a consortium blockchain platform built by the FISCO open-source working group), and controlled experiments and the experimental results illustrate the safety and practicability of the method.
Keyword:
Blockchain
Genetic algorithm
PBFT
Consensus algorithm
期刊
IF:
4.6
论文数:
2.1K
被引数:
6.6K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容