Optimal time self-stabilization in uniform dynamic systems

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


In this paper we present a randomized uniform self-stabilizing protocol that provides each (anonymous) processor of a uniform system with a distinct identifier. The protocol uses a predefined fixed amount of memory and stabilizes within expected Θ (d) time, where d is the actual diameter of the network. The naming protocol can be combined with self-stabilizing protocols that assume distinct identifiers for the processors. Thus, we achieve with optimal time and predefined amount of memory uniform self-stabilizing protocols for many tasks including: Spanning tree construction, leader election and reset.

Original languageEnglish
Pages (from-to)7-18
Number of pages12
JournalParallel Processing Letters
Issue number1
StatePublished - 1 Jan 1998


  • Distributed Algorithms
  • Dynamic Systems
  • Randomized Algorithms
  • Self-Stabilization
  • Uniform Systems

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture


Dive into the research topics of 'Optimal time self-stabilization in uniform dynamic systems'. Together they form a unique fingerprint.

Cite this