Time Optimal Self-Stabilizing Spanning Tree Algorithms

In this paper we present time-optimal self-stabilizing algorithms for asynchronous distributed spanning tree computation in networks. We present both a randomized algorithm for anonymous networks as well as a deterministic version for ID-based networks. Our protocols are the first to be time-optimal (i.e. stabilize in time O(diameter)) without any prior knowledge of the network size or diameter, assuming we are allowed messages of size O(ID). Both results are achieved through a new technique of symmetry breaking that may be of independent interest.

[1]  Baruch Awerbuch,et al.  Network synchronization with polylogarithmic overhead , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[2]  Yehuda Afek,et al.  Self-stabilization of the alternating-bit protocol , 1989, Proceedings of the Eighth Symposium on Reliable Distributed Systems.

[3]  Eugene Outley.  Self-stabilizing network protocols , 1992 .

[4]  Boaz Patt-Shamir,et al.  Adapting to asynchronous dynamic networks (extended abstract) , 1992, STOC '92.

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

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

[7]  Yossi Matias,et al.  Simple and Efficient Election Algorithms for Anonymous Networks , 1989, WDAG.

[8]  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.

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

[10]  Boaz Patt-Shamir,et al.  Adapting to Asynchronous Dynamic Networks , 1992 .

[11]  Jan K. Pachl,et al.  Uniform self-stabilizing rings , 1988, TOPL.

[12]  Amos Israeli,et al.  Uniform self-stabilizing leader election , 1993 .

[13]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[14]  Baruch Awerbuch,et al.  Dynamic networks are as fast as static networks , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

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

[17]  Nancy A. Lynch,et al.  Proving time bounds for randomized distributed algorithms , 1994, PODC '94.

[18]  Amos Israeli,et al.  Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact) , 1991, WDAG.

[19]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

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