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).
|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||16th Conference of Electrical and Electronics Engineers in Israel, EEIS 1989|
|Period||7/03/89 → 9/03/89|