Skip to main content
SpringerLink
Log in

On Probabilistic Snap-Stabilization

  • Conference paper
Distributed Computing and Networking (ICDCN 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8314))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alpern, B., Schneider, F.B.: Defining liveness. Inf. Process. Lett. 21(4), 181–185 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  2. 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)

    Google Scholar 

  3. Beauquier, J., Genolini, C., Kutten, S.: k-stabilization of reactive tasks. In: PODC, p. 318 (1998)

    Google Scholar 

  4. 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)

    Article  MATH  Google Scholar 

  5. Boulinier, C.: L’unisson. Ph.D. thesis, Université de Picardie Jules Verne (2007)

    Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. Boulinier, C., Petit, F., Villain, V.: When graph theory helps self-stabilization. In: PODC, pp. 150–159 (2004)

    Google Scholar 

  8. Bui, A., Datta, A.K., Petit, F., Villain, V.: Snap-stabilization and PIF in tree networks. Dist. Comp. 20(1), 3–19 (2007)

    MATH  Google Scholar 

  9. Cournier, A., Datta, A.K., Petit, F., Villain, V.: Enabling snap-stabilization. In: ICDCS, pp. 12–19 (2003)

    Google Scholar 

  10. Cournier, A., Devismes, S., Villain, V.: Snap-stabilizing pif and useless computations. In: ICPADS, pp. 39–48 (2006)

    Google Scholar 

  11. 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)

    Google Scholar 

  12. Devismes, S., Petit, F.: On efficiency of unison. In: TADDS, pp. 20–25 (2012)

    Google Scholar 

  13. Devismes, S., Tixeuil, S., Yamashita, M.: Weak vs. self vs. probabilistic stabilization. In: ICDCS, pp. 681–688 (2008)

    Google Scholar 

  14. Dijkstra, E.W.: Self-Stabilizing Systems in Spite of Distributed Control. Commun. ACM 17, 643–644 (1974)

    Article  MATH  Google Scholar 

  15. Dolev, S., Israeli, A., Moran, S.: Uniform Dynamic Self-Stabilizing Leader Election. IEEE Trans. Parallel Distrib. Syst. 8, 424–440 (1997)

    Article  Google Scholar 

  16. Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems (abstract). In: PODC, p. 255 (1995)

    Google Scholar 

  17. 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)

    Chapter  Google Scholar 

  18. Durrett, R.: Probability, theory and examples, Cambridge (2010)

    Google Scholar 

  19. Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.V.: Fault-containing self-stabilizing algorithms. In: PODC, pp. 45–54 (1996)

    Google Scholar 

  20. 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)

    Chapter  Google Scholar 

  21. Herman, T.: Probabilistic self-stabilization. Inf. Proc. Letters 35(2), 63–67 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  22. Israeli, A., Jalfon, M.: Token management schemes and random walks yield self-stabilizing mutual exclusion. In: PODC, pp. 119–131 (1990)

    Google Scholar 

  23. Manna, Z., Pnueli, A.: A hierarchy of temporal properties. In: PODC, pp. 377–410 (1990)

    Google Scholar 

  24. Matias, Y., Afek, Y.: Simple and efficient election algorithms for anonymous networks. In: WDAG, pp. 183–194 (1989)

    Google Scholar 

  25. Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1st edn. John Wiley & Sons, Inc. (1994)

    Google Scholar 

  26. Tel, G.: Introduction to Distributed Algorithms, 2nd edn. Cambridge University Press (2001)

    Google Scholar 

  27. Yamashita, M., Kameda, T.: Computing on anonymous networks: Part i-characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7(1), 69–89 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. VERIMAG UMR 5104, Université de Grenoble, France

    Karine Altisen & Stéphane Devismes

Authors
  1. Karine Altisen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stéphane Devismes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electrical Engineering and Computer Science, University of Central Florida, 4000 Central Florida Blvd., P.O. Box 162362, 32816-2362, Orlando, FL, USA

    Mainak Chatterjee

  2. Dept. of Computing, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

    Jian-nong Cao

  3. International Institute of Information Technology, 500 032, Hyderabad, India

    Kishore Kothapalli

  4. Instituto de Matemáticas, Universidad Nacional Autonoma de Mexico (UNAM), Ciudad Universitaria, D.F., 04510, Mexico

    Sergio Rajsbaum

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation