计算机与现代化 ›› 2022, Vol. 0 ›› Issue (12): 33-41.

• 算法设计与分析 • 上一篇    下一篇

面向边缘计算应用的拜占庭式容错分布式一致性算法

  

  1. (北京交通大学计算机与信息技术学院,北京100044)
  • 出版日期:2023-01-04 发布日期:2023-01-04
  • 作者简介:张昊(1995—),男,黑龙江大兴安岭人,硕士研究生,研究方向:边缘计算,分布式计算,E-mail: 19120437@bjtu.edu.cn; 通信作者:路红英(1963—),女,河南安阳人,高级工程师,研究方向:边缘计算,E-mail: hylu@bjtu.edu.cn。

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

摘要: 为解决边缘计算中边缘节点易于被攻击或俘获产生拜占庭错误,从而破坏边缘计算应用可用性的问题,设计一种面向边缘计算应用的拜占庭容错分布式一致性算法Edge-Raft。该算法在现有的经典Raft算法基础上,针对边缘环境中潜在的拜占庭错误进行重新设计,通过引入数字签名、同步日志检测、轮询选举、惰性投票、三阶段日志同步等机制,使其具有拜占庭容错特性的同时,将消息传递的复杂度限制至线性级,保证小于1/3的集群总数的边缘节点发生拜占庭错误时仍能为用户提供有效服务。基于不同节点规模的实验结果表明,与现有Raft算法相比,该算法在保留Raft算法可理解性的基础上,保证算法在边缘环境中的可用性与活性。相比于现有的实用拜占庭容错算法,所提算法将消息传递的时间复杂度限定在线性级,保证该算法在多节点边缘环境中的可拓展性。

关键词: 边缘计算, 拜占庭容错, 分布式, 一致性算法

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