Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures

作者:

Highlights:

摘要

We study consensus in asynchronous systems where membership is unknown, and where up to f degenerative Byzantine failures can happen. In our failure model a faulty process can have a Byzantine behavior (i.e., it deviates from its specification), and, furthermore, every faulty process will degenerate such that eventually it will have permanent physical or transmission failures. We present a simple algorithm that solves Consensus using the Omega failure detector and a new broadcast primitive called RFLOB in an asynchronous system with degenerative Byzantine failures, which is optimal with respect to failures because it works when f

论文关键词:Distributed algorithms,Consensus,Unknown membership,Omega failure detector,Byzantine failures

论文评审过程:Received 25 July 2017, Revised 21 December 2018, Accepted 3 June 2019, Available online 8 August 2019, Version of Record 6 October 2019.

论文官网地址:https://doi.org/10.1016/j.jcss.2019.06.003