IEEE Transactions on Computers
A fully distributed (minimal) spanning tree algorithm
Information Processing Letters
Electing a leader in a ring with link failures
Acta Informatica
Fault-Tolerant Distributed Algorithm for Election in Complete Networks
IEEE Transactions on Computers - Fault-Tolerant Computing
Election in a complete network with a sense of direction
Information Processing Letters
A Multiple Fault-Tolerant Processor Network Architecture for Pipeline Computing
IEEE Transactions on Computers
Tolerance of Double-Loop Computer Networks to Multinode Failures
IEEE Transactions on Computers
A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimal Distributed t-Resilient Election in Complete Networks
IEEE Transactions on Software Engineering
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
New lower bound techniques for distributed leader finding and other problems on rings of processors
Theoretical Computer Science
Designing fault-tolerant systems using automorphisms
Journal of Parallel and Distributed Computing
Towards optimal distributed election on chordal rings
Information Processing Letters
IEEE Transactions on Computers
A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
Information Sciences—Informatics and Computer Science: An International Journal
Faults and fault-tolerance in distributed computing systems: the election problem
Faults and fault-tolerance in distributed computing systems: the election problem
Leader election in the presence of link failures (abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Distributed loop computer networks: a survey
Journal of Parallel and Distributed Computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Optimal elections in labeled hypercubes
Journal of Parallel and Distributed Computing
A distributed election protocol for unreliable networks
Journal of Parallel and Distributed Computing
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares
IEEE Transactions on Computers
Election in Asynchronous Complete Networks with Intermittent Link Failures
IEEE Transactions on Computers
A Distributed Spanning Tree Algorithm
Proceedings of the 2nd International Workshop on Distributed Algorithms
Proceedings of the 3rd International Workshop on Distributed Algorithms
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
Sense of direction in distributed computing
Theoretical Computer Science - Special issue: Distributed computing
Leader Election in Extremely Unreliable Rings and Complete Networks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Hi-index | 14.98 |
Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental problem of Leader Election has been extensively studied, assuming either a fault-free system or an upper-bound on the number of link failures. We consider loop networks where an arbitrary number of links have failed and a processor can only detect the status of its incident links. We show that a Leader Election protocol in a faulty loop network requires only O(n log n) messages in the worst-case, where n is the number of processors. Moreover, we show that this is optimal. The proposed algorithm also detects network partitions. We also show that it provides an optimal solution for arbitrary nonfaulty networks with sense of direction.