Computer and Modernization ›› 2022, Vol. 0 ›› Issue (12): 33-41.

Previous Articles     Next Articles

Byzantine Fault-tolerant Distributed Consistency Algorithm for Edge Computing Applications


  1. (School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China)
  • Online:2023-01-04 Published:2023-01-04

Abstract: In order to solve the problem that edge nodes are easy to be attacked or captured to produce Byzantine errors and thus destroy the availability of edge computing applications, a Byzantine fault-tolerant distributed consistency algorithm Edge-Raft is designed for edge computing applications. The algorithm on the basis of the existing classical algorithm of Raft, under the conditions of edge, the Byzantine error of potential, with the introduction of digital signature, synchronous log detection, polling elections, inert vote, three phase synchronization mechanisms such as log, makes its have the Byzantine fault tolerance features at the same time, limits the complexity of the messaging to linear, ensures that the edge nodes with less than 1/3 of the total number of clusters can still provide effective services for users when Byzantine errors occur. Experimental results based on different node sizes show that compared with the existing Raft algorithm, the proposed algorithm retains the comprehensibility of Raft algorithm while ensuring the usability and activity of the proposed algorithm in the edge environment. Compared with the existing Practical Byzantine Fault Tolerance algorithms, the proposed algorithm limits the time complexity of message passing to the linear level, which ensures the scalability of the proposed algorithm in multi-node edge environment.

Key words: edge computing, Byzantine fault tolerance, distributed system, consistency algorithm