Bounding the unbounded

Baruch Awerbuch*, Boaz Patt-Shamir, George Varghese

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

15 Scopus citations


Many important protocols in distributed computing have simple and elegant solutions if we allow the assumption of unbounded size registers. This assumption can be simulated in practice using sufficiently large but bounded registers; however the resulting protocols are extremely vulnerable to transient faults. In this paper we present a general methodology for the transformation of unbounded register protocols so that they can work with bounded registers in a self-stabilizing fashion. The applicability of our method is demonstrated with two examples: spanning tree computation and topology update.

Original languageEnglish
Pages (from-to)776-783
Number of pages8
JournalProceedings - IEEE INFOCOM
StatePublished - 1994
EventProceedings of the IEEE INFOCOM'94. Part 2 (of 3) - Toronto, Ont, Can
Duration: 12 Jun 199416 Jun 1994


Dive into the research topics of 'Bounding the unbounded'. Together they form a unique fingerprint.

Cite this