Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networks

A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the systems recovers from this catastrophic situation without external intervention in finite time. Uni-directional networks preclude many common techniques in self-stabilization from being used, such as preserving local predicates. In this paper, we investigate the intrinsic complexity of achieving self-stabilization in unidirectional anonymous general networks, and focus on the classical vertex coloring problem. Specifically, we prove a lower bound of n states per process (where n is the network size) and a recovery time of at least n(n-1)/2 actions in total. We also provide a deterministic algorithm with matching upper bounds that performs in arbitrary unidirectional anonymous graphs.

[1]  Anish Arora,et al.  Tolerance to unbounded Byzantine faults , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..

[2]  Sébastien Tixeuil,et al.  Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings , 2004, DISC.

[3]  Mohamed G. Gouda,et al.  Stabilization of Routing in Directed Networks , 2001, WSS.

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

[5]  Sébastien Tixeuil,et al.  Self-stabilizing Vertex Coloring of Arbitrary Graphs , 2000 .

[6]  Sébastien Tixeuil,et al.  Self-Stabilizing Systems , 2003, Lecture Notes in Computer Science.

[7]  Deborah Estrin,et al.  Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks , 2002 .

[8]  Ajoy Kumar Datta,et al.  Self-stabilizing systems : 5th International Workshop, WSS 2001, Lisbon, Portugal, October 1-2, 2001 : proceedings , 2001 .

[9]  Sébastien Tixeuil,et al.  Self-stabilization with r-operators , 2001, Distributed Computing.

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

[11]  Shlomi Dolev,et al.  Self-stabilizing group communication in directed networks , 2003, Acta Informatica.

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

[13]  Yehuda Afek,et al.  Local Stabilizer , 2002, J. Parallel Distributed Comput..

[14]  Sébastien Tixeuil.  On a Space-Optimal Distributed Traversal Algorithm , 2001, WSS.

[15]  Ajoy Kumar Datta,et al.  Self-Stabilizing Algorithms in DAG Structured Networks , 1999, Parallel Process. Lett..

[16]  Sébastien Tixeuil,et al.  Transient fault detectors , 1998, Distributed Computing.

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

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

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

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

[21]  Maria Gradinariu Potop-Butucaru,et al.  Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings , 2007, Distributed Computing.

[22]  Sébastien Tixeuil,et al.  On Fast Randomized Colorings in Sensor Networks , 2005 .

[23]  T. Masuzawa,et al.  Stabilizing Link-Coloration of Arbitrary Networks with Unbounded Byzantine Faults , 2007 .

[24]  Sébastien Tixeuil,et al.  A lower bound on dynamic k-stabilization in asynchronous systems , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..