Self-stabilization by local checking and global reset

Baruch Awerbuch, Boaz Patt-Shamir, George Varghese, Shlomi Dolev

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


We describe a method for transforming asynchronous network protocols into protocols that can sustain any transient fault, i.e., become self-stabilizing. We combine the known notion of local checking with a new notion of internal reset, and prove that given any self-stabilizing internal reset protocol, any locally-checkable protocol can be made self-stabilizing. Our proof is constructive in the sense that we provide explicit code. The method applies to many practical network problems, including spanning tree construction, topology update, and virtual circuit setup.

Original languageEnglish
Title of host publicationDistributed Algorithms - 8th International Workshop, WDAG 1994, Proceedings
EditorsGerard Tel, Paul Vitanyi
PublisherSpringer Verlag
Number of pages14
ISBN (Print)9783540584490
StatePublished - 1994
Externally publishedYes
Event8th International Workshop on Distributed Algorithms, WDAG 1994 - Terschelling, Netherlands
Duration: 29 Sep 19941 Oct 1994

Publication series

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


Conference8th International Workshop on Distributed Algorithms, WDAG 1994


Dive into the research topics of 'Self-stabilization by local checking and global reset'. Together they form a unique fingerprint.

Cite this