Optimal Distributed t-Resilient Election in Complete Networks

@article{Itai1990OptimalDT,
  title={Optimal Distributed t-Resilient Election in Complete Networks},
  author={Alon Itai and Shay Kutten and Yaron Wolfsthal and Shmuel Zaks},
  journal={IEEE Trans. Software Eng.},
  year={1990},
  volume={16},
  pages={415-420}
}
We study the problem of distributed leader election in an asynchronous complete network, in presence of faults that occurred prior to the execution of the election algorithm. Failures of this type are encountered, for example, during a recovery from a crash in the network. For a network with n processors, k of which start the algorithm and at most t of which might he faulty, we present an algorithm that uses at most O ( n log k + n + kt) messages. We prove that this algorithm is optimal. We… CONTINUE READING