Optimal Snap-Stabilizing Neighborhood Synchronizer in Tree Networks

We propose a snap-stabilizing synchronization technique, called the Neighborhood Synchronizer that synchronizes nodes with their neighbors in a tree network. The scheme has optimal memory requirement — only one bit per processor. is snap-stabilizing [11], meaning that it always behaves according to its specification. The proposed synchronizer being snap-stabilizing is optimal in terms of stabilization time. We show an application of the synchronizer by designing an efficient broadcast algorithm in tree networks. is also snap-stabilizing and needs only 2h + 2m - 1 rounds to broadcast m messages, where h is the height of the tree.

[1]  Amos Israeli,et al.  Uniform Dynamic Self-Stabilizing Leader Election , 1997, IEEE Trans. Parallel Distributed Syst..

[2]  Shing-Tsaan Huang.  The Fuzzy Philosophers , 2000, IPDPS Workshops.

[3]  George Varghese.  Self-stabilization by counter flushing , 1994, PODC '94.

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

[5]  Ajoy Kumar Datta,et al.  Snap-stabilizing PIF algorithm in arbitrary networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[6]  Ajoy Kumar Datta,et al.  Self-Stabilizing Local Mutual Exclusion and Daemon Refinement , 2000, Chic. J. Theor. Comput. Sci..

[7]  Gerard Tel,et al.  Introduction to Distributed Algorithms: Contents , 2000 .

[8]  Pradip K. Srimani,et al.  Self-stabilizing Protocol for Mutual Exclusion among Neighboring Nodes in a Tree Structured Distributed System , 1999, Parallel Algorithms Appl..

[9]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

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

[11]  Ajoy Kumar Datta,et al.  Self-stabilization with global rooted synchronizers , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[12]  Masaaki Mizuno,et al.  A Transformation of Self-Stabilizing Serial Model Programs for Asynchronous Parallel Computing Environments , 1998, Inf. Process. Lett..

[13]  Ajoy Kumar Datta,et al.  Self-stabilizing neighborhood synchronizer in tree networks , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

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

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

[16]  H. S. M. Kruijer.  Self-Stabilization (in Spite of Distributed Control) in Tree-Structured Systems , 1979, Inf. Process. Lett..

[17]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[18]  Michel Raynal,et al.  Synchronization and control of distributed systems and programs , 1990, Wiley series in parallel computing.

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

[20]  Mohamed G. Gouda,et al.  The linear alternator , 1997, WSS.

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