Memory-efficient and self-stabilizing network RESET (extended abstract)

In this paper we consider the question of faulttolerant distributed network protocols with extremely small memory requirements per processor. In particular, we show that even in the case of worst-case transient faults (i.e., in a selfstabilizing setting), many fundamental network protocols can be achieved using only O(log* n) bits of memory per incident network edge. In the heart of our construction is a self-stabilizing asynchronous network RESET protocol with the same small memory requirements. *Johns Hopkins University, Baltimore, MD 21218, and MIT Lab. for Computer Science. E-mail: baruch@blaze.cs.jhu. edu. Supported by Air Force Contract TNDGAFOSR-86-O078, ARPA/Army contract DABT6393-C-0038, ARO contract DAAL03-86-K-0171, NSF contract 9114440-CCR, DARPA contract NOO014-J-92-1799. t U.C. Berkeley and ICSI. Supported by NSF postdoctoral fellowship and ICSI. E-mail: rafail@cs.berkeley. edu. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association of Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. PODC 948/94 Los Angeles CA USA (2) 1994 ACM 0-89791 -654-9/84/0008.$3.50

[1]  Manfred K. Warmuth,et al.  Gap Theorems for Distributed Computation , 1993, SIAM J. Comput..

[2]  Baruch Awerbuch,et al.  Applying static network protocols to dynamic networks , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[3]  Shmuel Katz,et al.  Self-stabilizing extensions for message-passing systems , 1990, PODC '90.

[4]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[5]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[6]  Israel Cidon,et al.  Paris: An approach to integrated high‐speed private networks , 1988 .

[7]  Amos Israeli,et al.  Resource bounds for self stabilizing message driven protocols , 1991, PODC '91.

[8]  Jeffrey M. Jaffe,et al.  SNA Networks of Small Systems , 1985, IEEE J. Sel. Areas Commun..

[9]  Amos Israeli,et al.  Self-stabilization of dynamic systems assuming only read/write atomicity , 1990, PODC '90.

[10]  Radia J. Perlman,et al.  Fault-Tolerant Broadcast of Routing Information , 1983, Comput. Networks.

[11]  B. Awerbuch,et al.  Distributed program checking: a paradigm for building self-stabilizing distributed protocols , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[12]  Edsger W. Dijkstra,et al.  Self stabilization in spite of distributed control , 1974 .

[13]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[14]  Moti Yung,et al.  Principle for high speed network control: congestion-and deadlock-freeness, self-routing, and a single buffer per link , 1990, PODC '90.

[15]  Boaz Patt-Shamir,et al.  Self-stabilization by local checking and correction , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[16]  Amos Israeli,et al.  Token management schemes and random walks yield self-stabilizing mutual exclusion , 1990, PODC '90.

[17]  Amos Israeli,et al.  Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity , 1990, PODC.

[18]  Boaz Patt-Shamir,et al.  Time optimal self-stabilizing synchronization , 1993, STOC.

[19]  Manfred K. Warmuth,et al.  Gap theorems for distributed computing , 1986, PODC '86.

[20]  Radia Perlman,et al.  An algorithm for distributed computation of a spanningtree in an extended LAN , 1985, SIGCOMM '85.

[21]  S. Wecker,et al.  DNA: The Digital Network Architecture , 1980, IEEE Trans. Commun..

[22]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[23]  Anish Arora,et al.  Distributed Reset (Extended Abstract) , 1990, FSTTCS.

[24]  S. Finn.  Resynch Procedures and a Fail-Safe Network Protocol , 1979, IEEE Trans. Commun..

[25]  Yoram Ofek,et al.  MetaRing-a full-duplex ring with fairness and spatial reuse , 1993, IEEE Trans. Commun..

[26]  Anish Arora,et al.  Distributed Reset , 1994, IEEE Trans. Computers.

[27]  Geoffrey Brown,et al.  Self-Stabilization of the Alternating-Bit Protocol , 1989, The Sixteenth Conference of Electrical and Electronics Engineers in Israel,.

[28]  Moti Yung,et al.  Memory-Efficient Self Stabilizing Protocols for General Networks , 1990, WDAG.

[29]  Baruch Awerbuch,et al.  Distributed control for PARIS , 1990, PODC '90.

[30]  Rafail Ostrovsky,et al.  Self-stabilizing symmetry breaking in constant-space (extended abstract) , 1992, STOC '92.