| Popis: |
As a consortium blockchain with the multi-center characteristics of public blockchain and the high-performance advantages of private blockchain,it has become the center of development of China.Combined with the characteristics of node trust in the consortium blockchain,non-byzantine fault tolerance consensus algorithm can provide better performance support for the consortium blockchain.By selecting Raft consensus algorithm as the research object,focusing on the leader election and log replication process in the Raft consensus algorithm,this paper proposes a non-byzantine fault tolerance consensus algorithm for consortium blockchain Kraft(Kademlia-Raft) consensus algorithm.It improves the process of Leader election and log replication in the Raft consensus algorithm by combining the two-layer Kademlia routing protocol.First,in view of the problem of voting efficiency caused by the number of Candidate nodes and the increase of Follower nodes in the Raft consensus algorithm,KRaft consensus algorithm uses K-bucket established by the two-layer Kademlia protocol to realize the stable election in the Candidate node set.Se-condly,in view of the low efficiency of the single-node log replication process of the Leader in the log replication process of Raft consensus algorithm and the load balance problem on the nodes,a parallel log replication scheme of multiple Candidate nodes is proposed to equalize the load on the Leader node,so as to improve the data throughput and the scalability of the algorithm at the same time.Finally,the local multi-node simulation experiment shows that the data throughput of KRaft consensus algorithm is increased by 34.5% compared with Raft consensus algorithm,the voting speed of Leader node is increased by 55.6%. |
