Electing a leader in a ring with link failures
Acta Informatica
New protocols for the election of a leader in a ring
Theoretical Computer Science
Time-optimal leader election in general networks
Journal of Parallel and Distributed Computing
Leader Election in the Presence of Link Failures
IEEE Transactions on Parallel and Distributed Systems
Optimal Elections in Faulty Loop Networks and Applications
IEEE Transactions on Computers
Broadcasting with linearly bounded transmission faults
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Broadcasting in hypercubes and star graphs with dynamic faults
Information Processing Letters
Optimal broadcasting in hypercubes with dynamic faults
Information Processing Letters
On an improved algorithm for decentralized extrema finding in circular configurations of processors
Communications of the ACM
Leader election in rings with nonunique labels
Fundamenta Informaticae
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
On fractional dynamic faults with threshold
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
In this paper we investigate deterministic leader election under the simple threshold model of omission dynamic faults: The computation is performed in synchronous steps; if the algorithm sends m messages in one particular step, then at most max {c G − 1,m − 1} of them may be lost without any notification to the sender, where c G is the edge-connectivity of the communication topology. Simple threshold and related models of dynamic faults have been mainly used in the study of information dispersal (broadcasting), while fault-tolerant leader election has been primarily considered in models with static faults. In this paper we combine these lines of research and present efficient algorithms for leader election on rings and complete networks in the simple threshold model. Somewhat surprisingly, obtaining some leader election is rather straightforward even in this harsh model. However, getting an efficient solution working in general case (arbitrary wake-up, unknown n) involves intricate techniques and careful accounting.