Self-stabilization of the alternating-bit protocol

Yehuda Afek; Geoffrey M. Brown

doi:10.1109/EEIS.1989.720145

Self-stabilization of the alternating-bit protocol

Yehuda Afek, Geoffrey M. Brown

School of Computer Science

Research output: Contribution to conference › Paper › peer-review

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 language	English
DOIs	https://doi.org/10.1109/EEIS.1989.720145
State	Published - 1989
Event	16th Conference of Electrical and Electronics Engineers in Israel, EEIS 1989 - Tel-Aviv, Israel Duration: 7 Mar 1989 → 9 Mar 1989

Conference

Conference	16th Conference of Electrical and Electronics Engineers in Israel, EEIS 1989
Country/Territory	Israel
City	Tel-Aviv
Period	7/03/89 → 9/03/89

Access to Document

10.1109/EEIS.1989.720145

Cite this

@conference{8bd594228d3e41d98f6e2c827a446445,

title = "Self-stabilization of the alternating-bit protocol",

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).",

author = "Yehuda Afek and Brown, {Geoffrey M.}",

note = "Publisher Copyright: {\textcopyright} 1990 IEEE.; null ; Conference date: 07-03-1989 Through 09-03-1989",

year = "1989",

doi = "10.1109/EEIS.1989.720145",

language = "אנגלית",

}

TY - CONF

T1 - Self-stabilization of the alternating-bit protocol

AU - Afek, Yehuda

AU - Brown, Geoffrey M.

PY - 1989

Y1 - 1989

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=85027632290&partnerID=8YFLogxK

U2 - 10.1109/EEIS.1989.720145

DO - 10.1109/EEIS.1989.720145

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:85027632290

Y2 - 7 March 1989 through 9 March 1989

ER -

Self-stabilization of the alternating-bit protocol

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this