Compact Self-Stabilizing Leader Election for Arbitrary Networks

We present a self-stabilizing leader election algorithm for arbitrary networks, with space-complexity $O(\max\{\log \Delta, \log \log n\})$ bits per node in $n$-node networks with maximum degree~$\Delta$. This space complexity is sub-logarithmic in $n$ as long as $\Delta = n^{o(1)}$. The best space-complexity known so far for arbitrary networks was $O(\log n)$ bits per node, and algorithms with sub-logarithmic space-complexities were known for the ring only. To our knowledge, our algorithm is the first algorithm for self-stabilizing leader election to break the $\Omega(\log n)$ bound for silent algorithms in arbitrary networks. Breaking this bound was obtained via the design of a (non-silent) self-stabilizing algorithm using sophisticated tools such as solving the distance-2 coloring problem in a silent self-stabilizing manner, with space-complexity $O(\max\{\log \Delta, \log \log n\})$ bits per node. Solving this latter coloring problem allows us to implement a sub-logarithmic encoding of spanning trees --- storing the IDs of the neighbors requires $\Omega(\log n)$ bits per node, while we encode spanning trees using $O(\max\{\log \Delta, \log \log n\})$ bits per node. Moreover, we show how to construct such compactly encoded spanning trees without relying on variables encoding distances or number of nodes, as these two types of variables would also require $\Omega(\log n)$ bits per node.

[1]  Shlomi Dolev,et al.  Memory requirements for silent stabilization , 1999, Acta Informatica.

[2]  Sébastien Tixeuil,et al.  Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative , 2017, Distributed Computing.

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

[4]  Maria Gradinariu Potop-Butucaru,et al.  Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler , 2001, Euro-Par.

[5]  Sébastien Tixeuil,et al.  A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks , 2004, ALGOSENSORS.

[6]  Janos Simon,et al.  Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings , 1995, WDAG.

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

[8]  Maria Gradinariu Potop-Butucaru,et al.  Fast Self-stabilizing Minimum Spanning Tree Construction - Using Compact Nearest Common Ancestor Labeling Scheme , 2010, DISC.

[9]  Chin-Tser Huang,et al.  Fault Masking in Tri-redundant Systems , 2006, SSS.

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

[11]  Pierre Fraigniaud,et al.  Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees , 2015, 2015 IEEE 35th International Conference on Distributed Computing Systems.

[12]  Sébastien Tixeuil,et al.  Self-Stabilization with r-Operators revisited , 2005, J. Aerosp. Comput. Inf. Commun..

[13]  Sriram V. Pemmaraju,et al.  Error-detecting codes and fault-containing self-stabilization , 2000, Inf. Process. Lett..

[14]  Sébastien Tixeuil,et al.  Self-stabilization with path algebra , 2003, Theor. Comput. Sci..

[15]  Sébastien Tixeuil,et al.  Compact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being Talkative , 2013, DISC.

[16]  Shing-Tsaan Huang,et al.  A Self-Stabilizing Algorithm for Constructing Spanning Trees , 1991, Inf. Process. Lett..

[17]  Mikhail J. Atallah,et al.  Algorithms and Theory of Computation Handbook , 2009, Chapman & Hall/CRC Applied Algorithms and Data Structures series.

[18]  Sébastien Tixeuil,et al.  A Taxonomy of Daemons in Self-stabilization , 2011, ArXiv.

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

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

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

[22]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[23]  B. Awerbuch,et al.  Memory-eecient and Self-stabilizing Network Reset , 2007 .

[24]  Leonid A. Levin,et al.  Fast and lean self-stabilizing asynchronous protocols , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[25]  Maria Gradinariu Potop-Butucaru,et al.  A super-stabilizing log(n)log(n)-approximation algorithm for dynamic Steiner trees , 2013, Theor. Comput. Sci..

[26]  Maria Gradinariu Potop-Butucaru,et al.  Memory space requirements for self-stabilizing leader election protocols , 1999, PODC '99.

[27]  Yehuda Afek,et al.  Self-stabilizing unidirectional network algorithms by power-supply , 1997, SODA '97.

[28]  Lélia Blin,et al.  A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon , 2015, 2015 IEEE International Parallel and Distributed Processing Symposium.

[29]  Shlomi Dolev,et al.  Self-Stabilizing Depth-First Search , 1994, Inf. Process. Lett..

[30]  Maria Gradinariu Potop-Butucaru,et al.  Token-Based Self-Stabilizing Uniform Algorithms , 2002, J. Parallel Distributed Comput..

[31]  Toshimitsu Masuzawa,et al.  Fast and compact self-stabilizing verification, computation, and fault detection of an MST , 2011, PODC '11.

[32]  Jean R. S. Blair,et al.  An Efficient Self-stabilizing Distance-2 Coloring Algorithm , 2009, SIROCCO.