基于 Raft 分组的实用拜占庭容错共识算法.

Aiming at the problems of the existing Byzantine fault-tolerant consensus mechanism applied to alliance chain, such as insufficient scalability and difficulty to support efficient and secure consensus under large-scale network nodes, this paper proposed a practical Byzantine fault-tolerant consensus algorithm(called H-PBFT) based on Raft clustering grouping by node grouping strategy. Firstly, the shuffled frog leaping algorithm combined with K-medoids clustering strategy using to cluster nodes in the system into multiple groups participated. The central nodes of each cluster nodes in the PBFT consensus of the main consensus cluster and the Raft algorithm introduced the improved supervision node was used to achieve consensus in each cluster group. Intra-group consensus mechanism supervised the introduction of nodes to make Raft algorithm Byzantine-resistant. Experimental results show that, compared with PBFT and Raft, this algorithm can improve fault tolerance performance in large-scale network node environment, and can also cluster nodes quickly and efficiently, improve consensus efficiency, reduce consensus communication overhead and complexity. This algorithm has better scalability, which can be better applied in alliance chain scenarios. [ABSTRACT FROM AUTHOR]