Abstract

This paper presents a distributed leader election algorithm for crash-recovery and omission environments. Contrary to previous works, our algorithm tolerates the occurrence of crash recoveries and message omissions to any process during some finite but unknown time, after which a majority of processes in the system remains up and does not omit messages. (C) 2016 Elsevier B.V. All rights reserved.