Abstract
In this paper, we introduce probabilistic snap-stabilization. We relax the definition of deterministic snap-stabilization without compromising its safety guarantees. In an unsafe environment, a probabilistically snap-stabilizing algorithm satisfies its safety property immediately after the last fault; whereas its liveness property is only ensured with probability 1.
We show that probabilistic snap-stabilization is more expressive than its deterministic counterpart. Indeed, we propose two probabilistic snap-stabilizing algorithms for a problem having no deterministic snap- or self-stabilizing solution: guaranteed service leader election in arbitrary anonymous networks. This problem consists in computing a correct answer to each process that initiates the question “Am I the leader of the network?”, i.e., (1) processes always computed the same answer to that question and (2) exactly one process computes the answer true.
Our solutions being probabilistically snap-stabilizing, the answers are only delivered within an almost surely finite time; however any delivered answer is correct, regardless the arbitrary initial configuration and provided the question has been properly started.
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
Alpern, B., Schneider, F.B.: Defining liveness. Inf. Process. Lett. 21(4), 181–185 (1985)
Angluin, D.: Local and global properties in networks of processors (extended abstract). In: 12th Annual ACM Symposium on Theory of Computing, pp. 82–93. ACM (1980)
Beauquier, J., Genolini, C., Kutten, S.: k-stabilization of reactive tasks. In: PODC, p. 318 (1998)
Beauquier, J., Gradinariu, M., Johnen, C.: Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. Dist. Comp. 20(1), 75–93 (2007)
Boulinier, C.: L’unisson. Ph.D. thesis, Université de Picardie Jules Verne (2007)
Boulinier, C., Levert, M., Petit, F.: Snap-stabilizing waves in anonymous networks. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds.) ICDCN 2008. LNCS, vol. 4904, pp. 191–202. Springer, Heidelberg (2008)
Boulinier, C., Petit, F., Villain, V.: When graph theory helps self-stabilization. In: PODC, pp. 150–159 (2004)
Bui, A., Datta, A.K., Petit, F., Villain, V.: Snap-stabilization and PIF in tree networks. Dist. Comp. 20(1), 3–19 (2007)
Cournier, A., Datta, A.K., Petit, F., Villain, V.: Enabling snap-stabilization. In: ICDCS, pp. 12–19 (2003)
Cournier, A., Devismes, S., Villain, V.: Snap-stabilizing pif and useless computations. In: ICPADS, pp. 39–48 (2006)
Datta, A., Larmore, L., Devismes, S., Heurtefeux, K., Rivierre, Y.: Self-stabilizing small k-dominating sets. International Journal of Networking and Computing 3(1) (2013)
Devismes, S., Petit, F.: On efficiency of unison. In: TADDS, pp. 20–25 (2012)
Devismes, S., Tixeuil, S., Yamashita, M.: Weak vs. self vs. probabilistic stabilization. In: ICDCS, pp. 681–688 (2008)
Dijkstra, E.W.: Self-Stabilizing Systems in Spite of Distributed Control. Commun. ACM 17, 643–644 (1974)
Dolev, S., Israeli, A., Moran, S.: Uniform Dynamic Self-Stabilizing Leader Election. IEEE Trans. Parallel Distrib. Syst. 8, 424–440 (1997)
Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems (abstract). In: PODC, p. 255 (1995)
Duflot, M., Fribourg, L., Picaronny, C.: Randomized finite-state distributed algorithms as markov chains. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 240–254. Springer, Heidelberg (2001)
Durrett, R.: Probability, theory and examples, Cambridge (2010)
Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.V.: Fault-containing self-stabilizing algorithms. In: PODC, pp. 45–54 (1996)
Gouda, M.G.: The theory of weak stabilization. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol. 2194, pp. 114–123. Springer, Heidelberg (2001)
Herman, T.: Probabilistic self-stabilization. Inf. Proc. Letters 35(2), 63–67 (1990)
Israeli, A., Jalfon, M.: Token management schemes and random walks yield self-stabilizing mutual exclusion. In: PODC, pp. 119–131 (1990)
Manna, Z., Pnueli, A.: A hierarchy of temporal properties. In: PODC, pp. 377–410 (1990)
Matias, Y., Afek, Y.: Simple and efficient election algorithms for anonymous networks. In: WDAG, pp. 183–194 (1989)
Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1st edn. John Wiley & Sons, Inc. (1994)
Tel, G.: Introduction to Distributed Algorithms, 2nd edn. Cambridge University Press (2001)
Yamashita, M., Kameda, T.: Computing on anonymous networks: Part i-characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7(1), 69–89 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Altisen, K., Devismes, S. (2014). On Probabilistic Snap-Stabilization. In: Chatterjee, M., Cao, Jn., Kothapalli, K., Rajsbaum, S. (eds) Distributed Computing and Networking. ICDCN 2014. Lecture Notes in Computer Science, vol 8314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45249-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-45249-9_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45248-2
Online ISBN: 978-3-642-45249-9
eBook Packages: Computer ScienceComputer Science (R0)