skip to main content
research-article

Light enabling snap-stabilization of fundamental protocols

Published:09 February 2009Publication History
Skip Abstract Section

Abstract

In this article, we show that some fundamental self- and snap-stabilizing wave protocols (e.g., token circulation, PIF, etc.) implicitly assume a very light property that we call BreakingIn. We prove that BreakingIn is strictly induced by self- and snap-stabilization. Combined with a transformer, BreakingIn allows to easily turn the non-fault-tolerant versions of those protocols into snap-stabilizing versions. Unlike the previous solutions, the transformed protocols are very efficient and work at least with the same daemon as the initial versions extended to satisfy BreakingIn. Finally, we show how to use an additional property of the transformer to design snap-stabilizing extensions of those fundamental protocols like Mutual Exclusion.

References

  1. Awerbuch, B. and Gallager, R. G. 1985. Distributed bfs algorithms. In Proceedings of the Annual Symosium on Foundations of Computer Science. IEEE, 250--256. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Bui, A., Datta, A., Petit, F., and Villain, V. 1999. State-optimal snap-stabilizing PIF in tree networks. In Proceedings of the 4th Workshop on Self-Stabilizing Systems. IEEE Computer Society Press, 78--85. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Cournier, A., Datta, A., Petit, F., and Villain, V. 2003. Enabling snap-stabilization. In Proceedings of the 23th International Conference on Distributed Computing Systems (ICDCS'03). IEEE Computer Society Press, 12--19. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Cournier, A., Devismes, S., Petit, F., and Villain, V. 2004. Snap-stabilizing depth-first search on arbitrary networks. In Proceedings of the International Conference on Principles of Distributed Systems (OPODIS'04). Lecture Notes in Computer Science, vol. 3544, 267--282. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Cournier, A., Devismes, S., Petit, F., and Villain, V. 2006. Snap-stabilizing depth-first search on arbitrary networks. Comput. J. 49, 3, 268--280. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Cournier, A., Devismes, S., and Villain, V. 2005. A snap-stabilizing DFS with a lower space requirement. In Proceedings of the 7th International Symposium on Self-Stabilizing Systems (SSS'05). Lecture Notes in Computer Science, vol. 3764, 33--47. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Cournier, A., Devismes, S., and Villain, V. 2006a. From self- to snap- stabilization. In Proceedings of the 8th International Symposium on Self-Stabilization, Safety, and Security (SSS'06). Lecture Notes in Computer Science, vol. 4280, 199--213. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Cournier, A., Devismes, S., and Villain, V. 2006b. Snap-stabilizing PIF and useless computations. In Proceedings of the 12th International Conference on Parallel and Distributed Systems (ICPADS'06). Vol. 1. IEEE Computer Society Press, 39--46. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Cournier, A., Devismes, S., and Villain, V. 2007. Light enabling snap-stabilization. Tech. rep. 2007-04, LaRIA, CNRS FRE 2733.Google ScholarGoogle Scholar
  10. Delaët, S., Ducourthial, B., and Tixeuil, S. 2005. Self-stabilization with r-operators revisited. In Self-Stabilizing Systems, T. Herman and S. Tixeuil, Eds. Lecture Notes in Computer Science, vol. 3764, 68--80. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Dijkstra, E. 1974. Self stabilizing systems in spite of distributed control. Comm. ACM 17, 643--644. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Dolev, S., Israeli, A., and Moran, S. 1997. Uniform dynamic self-stabilizing leader election. IEEE Trans. Parall. Distrib. Syst. 8, 4, 424--440. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Dolev, S. and Tzachar, N. 2006. Empire of colonies: Self-stabilizing and self-organizing distributed algorithms. In Proceedings of the International Conference on Principles of Distributed Systems (OPODIS). Number 4305 in Lecture Notes in Computer Science. Springer, 230--243. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Huang, S. and Chen, N. 1993. Self-stabilizing depth-first token circulation on networks. Distrib. Comput. 7, 61--66. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Huang, S.-T. and Chen, N.-S. 1992. A self-stabilizing algorithm for constructing breadth-first trees. Inf. Process. Lett. 41, 2, 109--117. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Johnen, C. 1997. Memory efficient, self-stabilizing algorithm to construct bfs spanning trees. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC'97). ACM Press, New York, NY, 288. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Johnen, C., Alima, L., Datta, A. K., and Tixeuil, S. 2002. Optimal snap-stabilizing neighborhood synchronizer in tree networks. Parall. Proc. Lett. 12, 3-4, 327--340.Google ScholarGoogle ScholarCross RefCross Ref
  18. Katz, S. and Perry, K. 1993. Self-stabilizing extensions for message-passing systems. Distrib. Comput. 7, 17--26. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Tel, G. Second edition 2001. Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, UK. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Villain, V. 2002. Snap-stabilization versus self-stabilization. Proceedings of the Journées Internationales sur l'auto-Stabilisation. CIRM, Luminy France.Google ScholarGoogle Scholar

Index Terms

  1. Light enabling snap-stabilization of fundamental protocols

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM Transactions on Autonomous and Adaptive Systems
        ACM Transactions on Autonomous and Adaptive Systems  Volume 4, Issue 1
        January 2009
        213 pages
        ISSN:1556-4665
        EISSN:1556-4703
        DOI:10.1145/1462187
        Issue’s Table of Contents

        Copyright © 2009 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 9 February 2009
        • Accepted: 1 September 2008
        • Revised: 1 July 2008
        • Received: 1 February 2007
        Published in taas Volume 4, Issue 1

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!