Large-scale Node Networking Consensus Algorithm for Cross-level Trusted Collaboration Services
In order to effectively improve the scalability,robustness,concurrency and processing efficiency of cross-level trusted collaboration services for data,an efficient consensus algorithm called Efficient Byzantine Fault Tolerance(EBFT)is proposed for multi-level large-scale node networking scenarios.On the basis of consensus algorithm,the rotation of master nodes is taken as part of the regular consensus process.All nodes take turns to serve as master node to make proposals,so as to reduce the pressure of having a single master node and ensure the fairness between the nodes.Additionally,fast consensus is achieved by merging the view switching process and the normal process,which further improves the flexibility,reliability and digital signature performance of the algorithm.Simulation experiments demonstrate that the proposed algorithm meets the actual requirements of cross-level large-scale service data flow for the processing capacity and response speed of information system.
cross-level trusted collaborationconsensus algorithmrotation of master nodesthreshold signaturesflexibility mechanism
国家科技期刊平台
NSTL
万方数据
