Self-stabilization of the alternating-bit protocol

Yehuda Afek, Geoffrey M. Brown

Research output: Contribution to conferencePaperpeer-review

5 Scopus citations

Abstract

It was recently shown that no data link protocol with finite sequence-numbers and deterministic finite state transmitter and receiver can tolerate transmitter and/or receiver crashes and recoveries, unless they have a non-volatile memory. Furthermore, it was proved that no self-stabilizing data link protocol in such a model exists. In this note we relax these assumptions and present two simple self-stabilizing data link protocols that use three sequence-numbers, and do not resort to nonvolatile memory. The first is a randomized protocol (i.e., relaxing the deterministic transmitter and/or receiver assumption), and the second is a deterministic protocol that requires the transmitter to generate an infinite, aperiodic sequence of sequence-numbers (i.e., relaxing the finite-state assumptions).

Original languageEnglish
DOIs
StatePublished - 1989
Event16th Conference of Electrical and Electronics Engineers in Israel, EEIS 1989 - Tel-Aviv, Israel
Duration: 7 Mar 19899 Mar 1989

Conference

Conference16th Conference of Electrical and Electronics Engineers in Israel, EEIS 1989
Country/TerritoryIsrael
CityTel-Aviv
Period7/03/899/03/89

Fingerprint

Dive into the research topics of 'Self-stabilization of the alternating-bit protocol'. Together they form a unique fingerprint.

Cite this