| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4950928 | Information Processing Letters | 2017 | 12 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Christian Fernández-Campusano, Mikel Larrea, Roberto Cortiñas, Michel Raynal,