Skip to main content
SpringerLink
Log in

Snap-Stabilizing Tasks in Anonymous Networks

  • Conference paper
  • First Online:
Book cover Stabilization, Safety, and Security of Distributed Systems (SSS 2016)

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

Abstract

We consider snap-stabilizing algorithms in anonymous networks. Self-stabilizing algorithms are well known fault tolerant algorithms: a self-stabilizing algorithm will eventually recover from arbitrary transient faults. On the other hand, an algorithm is snap-stabilizing if it can withstand arbitrary initial values and immediately satisfy its safety requirement. It is a subset of self-stabilizing algorithms. Distributed tasks that are solvable with self-stabilizing algorithms in anonymous networks have already been characterized by Boldi and Vigna in [BV02b].

In this paper, we show how the more demanding snap-stabilizing algorithms can be handled with standard tools for (not stabilizing) algorithms in anonymous networks. We give a characterization of which tasks are sovable by snap-stabilizing algorithms in anonymous networks. We also present a snap-stabilizing version of Mazurkiewicz’ enumeration algorithm.

This work exposes, from a task-equivalence point of view, the complete correspondence between self or snap-stabilizing tasks and distributed tasks with various termination detection requirements.

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 EPUB and 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

References

  1. Altisen, K., Devismes, S.: On probabilistic snap-stabilization. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 272–286. Springer, Heidelberg (2014). doi:10.1007/978-3-642-45249-9_18

    Chapter  Google Scholar 

  2. Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on Theory of Computing, pp. 82–93 (1980)

    Google Scholar 

  3. Boldi, P., Codenotti, B., Gemmell, P., Shammah, S., Simon, J., Vigna, S.: Symmetry breaking in anonymous networks: Characterizations. In: Proceedings 4th Israeli Symposium on Theory of Computing and Systems, pp. 16–26. IEEE Press (1996)

    Google Scholar 

  4. Bui, A., Datta, A.K., Petit, F., Villain, V.: State-optimal snap-stabilizing pif in tree networks. In Workshop on Self-stabilizing Systems, ICDCS 1999, pp. 78–85. IEEE Computer Society (1999)

    Google Scholar 

  5. Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Welch, J. (ed.) DISC 2001. LNCS, vol. 2180, pp. 33–47. Springer, Heidelberg (2001). doi:10.1007/3-540-45414-4_3

    Chapter  Google Scholar 

  6. Boldi, P., Vigna, S.: Fibrations of graphs. Discrete Math. 243(243), 21–66 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Boldi, P., Vigna, S.: Universal dynamic synchronous self-stabilization. Distr. Comput. 15, 137–153 (2002)

    Article  Google Scholar 

  8. Cournier, A., Devismes, S., Villain, V.: Light enabling snap-stabilization of fundamental protocols. ACM Trans. Auton. Adapt. Syst. 4(1), 6:1–6:27 (2009)

    Article  Google Scholar 

  9. Chalopin, J., Godard, E., Métivier, Y.: Local terminations and distributed computability in anonymous networks. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 47–62. Springer, Heidelberg (2008). doi:10.1007/978-3-540-87779-0_4

    Chapter  Google Scholar 

  10. Chalopin, J., Godard, E., Métivier, Y.: Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distrib. Comput. 25(4), 297–311 (2012)

    Article  MATH  Google Scholar 

  11. Chalopin, J.: Algorithmique distribuée, calculs locaux et homomorphismes de graphes. Ph.D. thesis, Université de Bordeaux I (2006)

    Google Scholar 

  12. Chalopin, J., Métivier, Y.: An efficient message passing election algorithm based on mazurkiewicz’s algorithm. Fundam. Inform. 80(1–3), 221–246 (2007)

    MATH  Google Scholar 

  13. Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)

    MATH  Google Scholar 

  14. Godard, E., Métivier, Y.: A characterization of families of graphs in which election is possible. In: Nielsen, M., Engberg, U. (eds.) FoSSaCS 2002. LNCS, vol. 2303, pp. 159–171. Springer, Heidelberg (2002). doi:10.1007/3-540-45931-6_12

    Chapter  Google Scholar 

  15. Godard, E., Métivier, Y., Tel, G.: Termination detection of local computations. Technical Report. arXiv:1001.2785v2, January 2010

  16. Godard, E.: A self-stabilizing enumeration algorithm. Inf. Process. Lett. 82(6), 299–305 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  17. Mazurkiewicz, A.: Solvability of the asynchronous ranking problem. Inf. Process. Lett. 28, 221–224 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  18. Métivier, Y., Muscholl, A., Wacrenier, P.-A.: About the local detection of termination of local computations in graphs. In: Krizanc, D., Widmayer, P. (eds.), SIROCCO 97–4th International Colloquium on Structural Information & Communication Complexity, Proceedings in Informatics, pp. 188–200. Carleton Scientific (1997)

    Google Scholar 

  19. Szymanski, B., Shy, Y., Prywes, N.: Terminating iterative solutions of simultaneous equations in distributed message passing systems. In: Proceedings of the 4th Symposium of Distributed Computing, pp. 287–292 (1985)

    Google Scholar 

  20. Tel, G.: Introduction to distributed algorithms. Cambridge University Press, New York (2000)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aix-Marseille Université, CNRS, Centrale Marseille, LIF, Marseille, France

    Emmanuel Godard

Authors
  1. Emmanuel Godard
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emmanuel Godard .

Editor information

Editors and Affiliations

  1. McMaster University, Hamilton, Ontario, Canada

    Borzoo Bonakdarpour

  2. LIP6, INRIA, UPMC Sorbonne Universities, Paris, France

    Franck Petit

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Godard, E. (2016). Snap-Stabilizing Tasks in Anonymous Networks. In: Bonakdarpour, B., Petit, F. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2016. Lecture Notes in Computer Science(), vol 10083. Springer, Cham. https://doi.org/10.1007/978-3-319-49259-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49259-9_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49258-2

  • Online ISBN: 978-3-319-49259-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation