Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.: Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery 17, 643–644 (1974)
Bui, A., Datta, A., Petit, F., Villain, V.: State-optimal snap-stabilizing PIF in tree networks. In: Proceedings of the Fourth Workshop on Self-Stabilizing Systems, pp. 78–85. IEEE Computer Society Press, Los Alamitos (1999)
Provan, J.S., Ball, M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM Journal of Computing 12, 777–788 (1983)
Karger, D.R.: Minimum cuts in near-linear time. Journal of the ACM 47, 46–76 (2000)
Ahmad, S.H.: Simple enumeration of minimal cutsets of acyclic directed graph. IEEE Transactions on Reliability 37, 484–487 (1988)
Whited, D.E., Shier, D.R., Jarvis, J.P.: Reliability computations for planar networks. OSRA Journal of Computing 2(1), 46–60 (1990)
Fard, N.S., Lee, T.H.: Cutset enumeration of network systems with link and node failure. Reliability Engineering and System Safety 65, 141–146 (1999)
Rai, S.: A cutset approach to reliability evaluation in communication networks. IEEE Transactions on Reliability 31, 428–431 (1982)
Cournier, A., Devismes, S., Petit, F., Villain, V.: Snap-stabilizing depth-first search on arbitrary networks. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, pp. 267–282. Springer, Heidelberg (2005)
Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election. IEEE Transactions on Parallel and Distributed Systems 8, 424–440 (1997)
Cournier, A., Datta, A., Petit, F., Villain, V.: Enabling snap-stabilization. In: 23th International Conference on Distributed Computing Systems (ICDCS 2003), pp. 12–19 (2003)
Tel, G.: Introduction to distributed algorithms, 2nd edn. Cambridge University Press, Cambridge (2001)
Datta, A.K., Gurumurthy, S., Petit, F., Villain, V.: Self-stabilizing network orientation algorithms in arbitrary rooted networks. In: International Conference on Distributed Computing Systems, pp. 576–583 (2000)
Huang, S., Chen, N.: Self-stabilizing depth-first token circulation on networks. Distributed Computing 7, 61–66 (1993)
Datta, A., Johnen, C., Petit, F., Villain, V.: Self-stabilizing depth-first token circulation in arbitrary rooted networks. Distributed Computing 13(4), 207–218 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cournier, A., Devismes, S., Villain, V. (2005). Snap-Stabilizing Detection of Cutsets. In: Bader, D.A., Parashar, M., Sridhar, V., Prasanna, V.K. (eds) High Performance Computing – HiPC 2005. HiPC 2005. Lecture Notes in Computer Science, vol 3769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602569_50
Download citation
DOI: https://doi.org/10.1007/11602569_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30936-9
Online ISBN: 978-3-540-32427-0
eBook Packages: Computer ScienceComputer Science (R0)