Electing a leader in a ring with link failures
Acta Informatica
Extended impossibility results for asynchronous complete networks
Information Processing Letters
Fault-Tolerant Distributed Algorithm for Election in Complete Networks
IEEE Transactions on Computers - Fault-Tolerant Computing
The multi-tree approach to reliability in distributed networks
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Easy impossibility proofs for distributed consensus problems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Time and message bounds for election in synchronous and asynchronous complete networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Making Distributed Spanning Tree Algorithms Fault-Resilient
STACS '87 Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Optimal Elections in Faulty Loop Networks and Applications
IEEE Transactions on Computers
Sense of direction in distributed computing
Theoretical Computer Science - Special issue: Distributed computing
Design and analysis of dynamic leader election protocols in broadcast networks
Distributed Computing
Simulation of a Novel Leader Election Protocol with the Use of Petri Nets
DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
A leader election protocol for timed asynchronous distributed systems
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
| Hi-index | 0.01 |
The problem of distributed leader election in an asynchronous complete network, in the presence of faults that occurred prior to the execution of the election algorithm, is discussed. 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 that uses at most O(n log k+n+kt) messages is presented and shown to be optimal. An optimal algorithm for the case where the identities of the neighbors are known is also presented. It is noted that the order of the message complexity of a t-resilient algorithm is not always higher than that of a nonresilient one. The t-resilient algorithm is a systematic modification of an existing algorithm for a fault-free network.