Spanders: distributed spanning expanders

We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. We use folklore results to randomly define an expander graph. Given the randomized nature of our algorithms, a monitoring technique is presented for ensuring the desired results. The monitoring is based on the fact that expanders have a rapid mixing time and the possibility of examining the rapid mixing time by O(nlogn) short (O(log4 n) length) random walks even for non regular expanders. We then employ our results to construct a hierarchical sequence of spanders, each of them an expander spanning the previous one. Such a sequence of spanders may be used to achieve different quality of service assurances in different applications. Several snap-stabilizing algorithms that are used to utilize the monitoring are presented, including reset and token tracing algorithms for message passing systems.

[1]  Jared Saia,et al.  Choosing a random peer , 2004, PODC '04.

[2]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[3]  Kai-Yeung Siu,et al.  Distributed construction of random expander networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[4]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[5]  Anish Arora,et al.  Maintaining Digital Clocks In Step , 1991, WDAG.

[6]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[7]  Alistair Sinclair,et al.  Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow , 1992, LATIN.

[8]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[9]  Michael K. Reiter,et al.  Distributed construction of a fault-tolerant network from a tree , 2005, 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05).

[10]  Franck Petit,et al.  Enabling snap-stabilization , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[11]  Shlomi Dolev,et al.  Empire of colonies: Self-stabilizing and self-organizing distributed algorithm , 2009, Theor. Comput. Sci..

[12]  P. Diaconis,et al.  Geometric Bounds for Eigenvalues of Markov Chains , 1991 .

[13]  Anish Arora,et al.  Unifying stabilization and termination in message-passing systems , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[14]  A. Grama,et al.  Distributed Uniform Sampling in Real- World Networks , 2004 .

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

[16]  Shlomi Dolev,et al.  Empire of Colonies: Self-stabilizing and Self-organizing Distributed Algorithms , 2006, OPODIS.

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

[18]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[19]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[20]  Noga Alon,et al.  Many random walks are faster than one , 2007, SPAA '08.

[21]  Seshadhri Comandur,et al.  Testing Expansion in Bounded Degree Graphs , 2007, Electron. Colloquium Comput. Complex..