Uniform dynamic self-stabilizing leader election

Shlomi Dolev, Amos Israeli, Shlomo Moran

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

26 Scopus citations


A distributed system is self-stabilizing if it can be started in any possible global state. Once started the system regains its consistency by itself, without any kind of an outside intervention. The self-stabilization property makes the system tolerant to faults in which processors crash and then recover spontaneously in an arbitrary state. When the intermediate period in between one recovery and the next crash is long enough the system stabilizes. A distributed system is uniform if all processors with the same number of neighbors are identical. A distributed system is dynamic if it can tolerate addition or deletion of processors and links without reinitialization. In this work we present three dynamic, uniform, self-stabilizing protocols for leader election: The first protocol works on complete graphs. The second protocol works for systems with unbounded number of processor in which the size of the memory of a processor is unbounded. The third protocol works for systems whose communication graph has a bounded diameter; it uses a bounded amount of memory. We conclude this work by presenting a simple, uniform, self-stabilizing ranking protocol.

Original languageEnglish
Title of host publicationDistributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings
EditorsPaul G. Spirakis, Lefteris Kirousis, Sam Toueg
PublisherSpringer Verlag
Number of pages14
ISBN (Print)9783540552369
StatePublished - 1 Jan 1992
Externally publishedYes
Event5th International Workshop on Distributed Algorithms, WDAG 1991 - Delphi, Greece
Duration: 7 Oct 19919 Oct 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume579 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th International Workshop on Distributed Algorithms, WDAG 1991

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Uniform dynamic self-stabilizing leader election'. Together they form a unique fingerprint.

Cite this