Electing a leader in a ring with link failures

DOI10.1007/BF00290707zbMath0591.68021MaRDI QIDQ1075046

Liuba Shrira, Oded Goldreich

Publication date: 1987

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

algorithmlink failuresasynchronous networksdistributed computationmessage complexityring of asynchronous processors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Related Items (4)

Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links ⋮ Design and analysis of dynamic leader election protocols in broadcast networks ⋮ Fast and compact self-stabilizing verification, computation, and fault detection of an MST ⋮ On the complexity of computation in the presence of link failures: The case of a ring

Cites Work

• The multi-tree approach to reliability in distributed networks
• On describing the behavior and implementation of distributed systems
• Electing a leader in a synchronous ring
• Decentralized extrema-finding in circular configurations of processors
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• An improved algorithm for decentralized extrema-finding in circular configurations of processes

This page was built for publication: Electing a leader in a ring with link failures