A Snap-Stabilizing DFS with a Lower Space Requirement

A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In [4], we presented the first snap-stabilizing depth-first search (DFS) wave protocol for arbitrary rooted networks working under an unfair daemon. However, this protocol needs O(NN) states per processors (where N is the number of processors) and needs ids on processors. In this paper, we propose an original snap-stabilizing solution for this problem with a strongly enhanced space complexity, i.e., O(Δ2 × N) states where Δ is the degree of the network. Furthermore, this new protocol does not need a completely identified network: only the root needs to be identified, i.e., the network is semi-anonymous.

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

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

[3]  Ajoy Kumar Datta,et al.  State-optimal snap-stabilizing PIF in tree networks , 1999, Proceedings 19th IEEE International Conference on Distributed Computing Systems.

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

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

[6]  Franck Petit,et al.  Time and Space Optimality of Distributed Depth-First Token Circulation Algorithms , 1999, WDAS.

[7]  Franck Petit,et al.  Snap-Stabilizing Depth-First Search on Arbitrary Networks , 2006, Comput. J..

[8]  W DijkstraEdsger.  Self-stabilizing systems in spite of distributed control , 1974 .

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

[10]  Vincent Villain,et al.  An Improved Snap-Stabilizing PIF Algorithm , 2003, Self-Stabilizing Systems.

[11]  Ajoy Kumar Datta,et al.  Self-stabilizing depth-first token circulation in arbitrary rooted networks , 2000, Distributed Computing.

[12]  Ajoy Kumar Datta,et al.  Self-Stabilizing Depth-First Token Passing on Rooted Networks , 1997, WDAG.

[13]  Shing-Tsaan Huang,et al.  Self-stabilizing depth-first token circulation on networks , 2005, Distributed Computing.

[14]  Joffroy Beauquier,et al.  Space-Efficient, Distributed and Self-Stabilizing Depth-First Token Circulation , 1995 .

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