Snap-Stabilizing Detection of Cutsets

A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. Here, we present the first snap-stabilizing protocol for arbitrary rooted networks which detects if a set of nodes is a cutset. This protocol is based on the depth-first search (DFS) traversal and its properties. One of the most interesting properties of our protocol is that, despite the initial configuration, as soon as the protocol is initiated by the root, the result obtained from the computations will be right. So, after the first execution of the protocol, the root is able to take a decision: “the input set is a cutset or not”, and this decision is right.

[1]  Pranay Chaudhuri,et al.  A self-stabilizing algorithm for bridge finding , 1999, Distributed Computing.

[2]  Douglas R. Shier,et al.  Reliability Computations for Planar Networks , 1990, INFORMS J. Comput..

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

[4]  Suresh Rai,et al.  A Cutset Approach to Reliability Evaluation in Communication Networks , 1982, IEEE Transactions on Reliability.

[5]  Sayeed Ahmad.  Simple enumeration of minimal cutsets of acyclic directed graph , 1988 .

[6]  Mehmet Hakan Karaata,et al.  A Self-Stabilizing Algorithm for Finding Articulation Points , 1999, Int. J. Found. Comput. Sci..

[7]  David R. Karger,et al.  Minimum cuts in near-linear time , 1998, JACM.

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

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

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

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

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

[13]  Pranay Chaudhuri,et al.  An $O(n^2)$ Self-Stabilizing Algorithm for Computing Bridge-Connected Components , 1999, Computing.

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

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

[16]  Pranay Chaudhuri.  A note on self-stabilizing articulation point detection , 1999, J. Syst. Archit..

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

[18]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[19]  Nasser Fard,et al.  Cutset enumeration of network systems with link and node failures , 1999 .

[20]  Ajoy Kumar Datta,et al.  Self-stabilizing network orientation algorithms in arbitrary rooted networks , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

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

[22]  Stéphane Devismes.  A Silent Self-stabilizing Algorithm for Finding Cut-nodes and Bridges , 2005, Parallel Process. Lett..

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