Summary
A self-stabilizing system has the property that it will converge to a desirable state when started from any state. Most previous researchers assumed that processes in self-stabilizing systems may communicate through shared variables while those that studied meassage passing systems allowed messages with unbounded size. This paper discusses the development of self-stabilizing systems which communicate through message passing, and in which messages may be lost in transit. The systems presented all use fixed size message headers. First, a selfstabilizing version of theAlternating Bit Protocol, a fundamental communication protocol for transmitting data across an unreliable communication medium, is presented. Secondly, the alternating-bit protocol is used to construct a self-stabilizing token ring.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
[AAG87] Afek Y, Awerbuch B, Gafni E: Applying static network protocols to dynamic networks. Proc 28th IEEE Annual Symposium on Foundation of Computer Science, pp 358–370, 1987.
[AG88] Afek Y, Gafni E: End-to-end communication in unreliable networks. Proc 7th ACM Symposium on Principles of Distributed Computing, pp 131–148, 1988
[AUWY82] Aho AV, Ullman JD, Wyner AD, Yannakakis M: Bounds on the size and transmission rate of communication protocols. Comp Math Appl 8(3): 205–214 (1982)
[BGM90] Burns JE, Gouda MG, Miller RE: Stabilization and pseudo stabilization. Tech Rep TR-90-13, University of Texas at Austin, 1990
[BGW87] Brown GM, Gouda MG, Wu C-1: A self-stabilizing token system. Hawaii Int Conf on System Sciences, pp 218–223, 1987.
[BGW89] Brown GM, Gouda MG, Wu C-1: Token systems that self-stabilize. IEEE Trans Comput c38(6): 845–852 (1989)
[BP89] Burns J, Pachl J: Uniform self-stabilizing rings. ACM Trans Program Lang Syst 11: 330–344 (1989)
[BS83] Baratz AE, Segall A: Reliable link initialization procedures. In: Rudin H, West CH (eds) IFIP 3rd Workshop on Protocol Specification, Testing and Verification. IEEE Transact Commun 36(2): 144–152 (1988)
[BSW69] Bartlett KA, Scantlebury RA, Wilkinson PT: A note on reliable full-duplex transmission over half-duplex links. Commun ACM 12: 260–261 (1969)
[Dij74] Dijkstra EW: Self-stabilizing systems in spite of distributed control. Commun ACM 17(11): 643–644 (1974)
[Dij82] Dijkstra EW: EWD 391 self-stabilization in spite of distributed control. Lect Notes Comput Sci, vol 92. Springer, Berlin Heidelberg New York 1982, pp 41–46
[GM91] Gouda MG, Multari N: Stabilizing communications protocols. IEEE Trans Comput tc-40(4): 448–458 (1991)
[Gou85] Gouda MG: On a ‘simple protocol whose proof isn't’: the state machine approach. IEEE Trans Commun com-33(4): 380–383 (1985)
[Hai85] Halpern B: A simple protocol whose proof isn't. IEEE Trans Commun com-33(4): 330–337 (1985)
[KP89] Katz S, Perry KJ: Self-stabilizing extensions for message-passing systems. In: Evangelist M, Katz S (eds) MCC Tech Rep Number STP-379-89, Proc MCC Workshop on Self-Stabilizing Systems, 1989. (Also in PODC-90)
[Kru79] Kruijer HSM: Self-stabilization (in spite of distributed control) in tree-structured systems. Inf Process Lett 8(2): 91–95 (1979)
[Lam84] Lamport L: The mutual exclusion problem: Part II-statement and solutions. J ACM 33(2): 327–348 (1984)
[LMF88] Lynch N, Mansour Y, Fekete A: The data link layer: two impossibility results. Proc ACM Symposium on Principles of Distributed Computing, pp 149–170, 1988
[PS88] Paliwoda K, Sanders JW: The sliding-window protocol in CSP. Tech Rep PRG-66, Oxford University Computing Laboratory, 1988.
[Ste76] Stenning MV: A data transfer protocol. Comput Networks 1: 99–110 (1976)
[Tan81] Tanenbaum AS: Comput Networks 2: 223–239 (1988)
Author information
Authors and Affiliations
Additional information
Yehuda Afek received a B.Sc. in Electrical Engineering from the Technion and an M.S. and Ph.D. in Computer Science from the University of California, Los Angeles. In 1985 he joined the Distributed Systems research Department in AT&T Bell Laboratories and in 1988 he joined the Department of Computer Science in Tel-Aviv University. His interests include communication protocols, distributed systems, and asynchronous shared memories.
Geoffrey M. Brown received the BS degree in Engineering from Swarthmore College in 1982, the MS degree in Electrical Engineering from Stanford University in 1983, and the Ph.D. degree in Electrical Engineering from the University of Texas at Austin in 1987. From 1983 to 1984 he worked for Motorola in Austin, TX. Currently he is an Assistant Professor in the School of Electrical Engineering at Cornell University. In 1990, Brown was named a Presidential Young Investigator by the National Science Foundation.
This work supported in part by NSF grant CCR-9058180
Rights and permissions
About this article
Cite this article
Afek, Y., Brown, G.M. Self-stabilization over unreliable communication media. Distrib Comput 7, 27–34 (1993). https://doi.org/10.1007/BF02278853
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02278853