Skip to main content
SpringerLink
Log in

Snap-stabilization and PIF in tree networks

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

The contribution of this paper is threefold. First, we present the paradigm of snap-stabilization. A snap- stabilizing protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves according to its specification. So, a snap-stabilizing protocol is a time optimal self-stabilizing protocol (because it stabilizes in 0 rounds). Second, we propose a new Propagation of Information with Feedback (PIF) cycle, called Propagation of Information with Feedback and Cleaning (\(\mathcal{PFC}\)). We show three different implementations of this new PIF. The first one is a basic \(\mathcal{PFC}\) cycle which is inherently snap-stabilizing. However, the first PIF cycle can be delayed O(h 2) rounds (where h is the height of the tree) due to some undesirable local states. The second algorithm improves the worst delay of the basic \(\mathcal{PFC}\) algorithm from O(h 2) to 1 round. The state requirement for the above two algorithms is 3 states per processor, except for the root and leaf processors that use only 2 states. Also, they work on oriented trees. We then propose a third snap-stabilizing PIF algorithm on un-oriented tree networks. The state requirement of the third algorithm depends on the degree of the processors, and the delay is at most h rounds. Next, we analyze the maximum waiting time before a PIF cycle can be initiated whether the PIF cycle is infinitely and sequentially repeated or launch as an isolated PIF cycle. The analysis is made for both oriented and un-oriented trees. We show or conjecture that the two best of the above algorithms produce optimal waiting time. Finally, we compute the minimal number of states the processors require to implement a single PIF cycle, and show that both algorithms for oriented trees are also (in addition to being time optimal) optimal in terms of the number of states.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Afek, Y., Kutten, S., Yung, M.: Memory-efficient self-stabilization on general networks. In: WDAG90 Distributed Algorithms 4th International Workshop Proceedings. LNCS, vol. 486, pp. 15–28. Springer (1990)

  2. Alima, L.O., Beauquier, J., Datta, A.K., Tixeuil, S.: Self-stabilization with global rooted synchronizers. In: ICDCS98 Proceedings of the 18th International Conference on Distributed Computing Systems, pp. 102–109 (1998)

  3. Arora A. and Gouda M.G. (1994). Distributed reset. IEEE Trans. Comput. 43: 1026–1038

    Article  MATH  Google Scholar 

  4. Awerbuch, B., Kutten, S., Mansour, Y., Patt-Shamir, B., Varghese, G.: Time optimal self-stabilizing synchronization. In STOC93 Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 652–661 (1993)

  5. Awerbuch, B., Ostrovsky, R.: Memory-efficient and self-stabilizing network reset. In PODC94 Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 254–263 (1994)

  6. Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction. In: FOCS91 Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pp. 268–277 (1991)

  7. Awerbuch, B., Patt-Shamir, B., Varghese, G., Dolev, S.: Self-stabilizing by local checking and global reset. In: WDAG94 Distributed Algorithms 8th International Workshop Proceedings, LNCS, vol. 857, pp. 326–339. Springer (1994)

  8. Awerbuch, B., Varghese, G.: Distributed program checking: a paradigm for building self-stabilizing distributed protocols. In: FOCS91 Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pp. 258–267 (1991)

  9. Brown G.M., Gouda M.G. and Wu C.L. (1989). Token systems that self-stabilize. IEEE Trans. Comput. 38: 845–852

    Article  Google Scholar 

  10. Bui, A., Datta, A.K., Petit, F., Villain, V.: Snap-stabilizing PIF algorithm in tree networks without sense of direction. In: SIROCCO’99, The 6th International Colloquium On Structural Information and Communication Complexity Proceedings, pp. 32–46. Carleton University Press (1999)

  11. Bui, A., Datta, A.K., Petit, F., Villain, V.: Space optimal PIF algorithm: self-stabilizing with no extra space. In: IPCCC’99, IEEE International Performance, Computing, and Communications Conference, pp. 20–26. IEEE Computer Society Press (1999)

  12. Bui, A., Datta, A.K., 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 (1999)

  13. Chang E.J.H. (1982). Echo algorithms: depth parallel operations on general graphs. IEEE Trans. Softw. Eng. SE-8: 391–401

    Article  Google Scholar 

  14. Cournier, A., Datta, A.K., Petit, F., Villain, V.: Optimal snap-stabilizing PIF in un-oriented trees. In: 5th International Conference on Principles of Distributed Systems Proceedings (OPODIS 2001), pp. 71–90 (2001)

  15. Datta, A.K., Gurumurthy, S., Petit, F., Villain, V.: Self-stabilizing network orientation algorithms in arbitrary rooted networks. In: IEEE 20th International Conference on Distributed Computing Systems (ICDCS 00), pp. 576–583. IEEE Computer Society Press (2000)

  16. Datta, A.K., Johnen, C., Petit, F., Villain, V.: Self-stabilizing depth-first token circulation in arbitrary rooted networks. In: SIROCCO’98, The 5th International Colloquium on Structural Information and Communication Complexity Proceedings, pp. 229–243. Carleton University Press (1998)

  17. Dijkstra E.W. (1974). Self stabilizing systems in spite of distributed control. Commun. Assoc. Comput. Mach. 17: 643–644

    MATH  Google Scholar 

  18. Dolev, S., Herman, T.: Parallel composition of stabilizing algorithms. In: Proceedings of the Fourth Workshop on Self-Stabilizing Systems, pp. 25–32. IEEE Computer Society Press (1999)

  19. Dolev S., Israeli A. and Moran S. (1993). Self-stabilization of dynamic systems assuming only read/write atomicity. Distrib. Comput. 7: 3–16

    Article  Google Scholar 

  20. Dolev S., Israeli A. and Moran S. (1997). Uniform dynamic self-stabilizing leader election. IEEE Trans. Parallel Distrib. Systems 8(4): 424–440

    Article  Google Scholar 

  21. Ghosh S. (1993). An alternative solution to a problem on self-stabilization. ACM Trans. Program. Lang. Systems 15: 735–742

    Article  Google Scholar 

  22. Gouda M.G. and Herman T. (1991). Adaptive programming. IEEE Trans. Softw. Eng 17(9): 911–921

    Article  Google Scholar 

  23. Huang S.T. and Chen N.S. (1993). Self-stabilizing depth-first token circulation on networks. Distrib. Comput. 7: 61–66

    Article  Google Scholar 

  24. Johnen, C., Alima, L.O., Datta, A.K., Tixeuil, S.: Self-stabilizing neighborhood synchronizer in tree networks. In Proceedings of the 19th IEEE International Conference on Distributed Computing Systems, pp. 487–494. IEEE Computer Society Press (1999)

  25. Kruijer H.S.M. (1979). Self-stabilization (in spite of distributed control) in tree-structured systems. Inf. Process. Lett. 8: 91–95

    Article  MATH  Google Scholar 

  26. Lynch, N.: Distributed Algorithms. Morgan Kaufmann (1996)

  27. Petit F. and Villain V. (1998). Optimality and self-stabilisation in tree networks. Parallel Process. Lett. 10(1): 3–14

    Google Scholar 

  28. Petit, F., Villain, V.: Time and space optimality of distributed depth-first token circulation algorithms. In: Proceedings of DIMACS Workshop on Distributed Data and Structures, pp. 91–106. Carleton University Press (1999)

  29. Segall A. (1983). Distributed network protocols. IEEE Trans. Inf. Theory IT-29: 23–35

    Article  Google Scholar 

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

  31. Varghese, G.: Self-stabilization by counter flushing. In: PODC94 Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 244–253, (1994)

  32. Varghese, G.: Compositional proofs of self-stabilizing protocols. In: Proceedings of the Third Workshop on Self-Stabilizing Systems, pp. 80–94. Carleton University Press (1997)

  33. Villain, V.: A new lower bound for self-stabilizing mutual exclusion algorithms. Technical Report RR97-17, LaRIA, University of Picardie Jules Verne (1997)

  34. Villain, V.: New tool and lower bounds of self-stabilizing mutual exclusion. Technical Report RR98-08, LaRIA, University of Picardie Jules Verne, 1998. Also presented at Dagstuhl Workshop on Self-Stabilization, August 17–21, 1998, Germany

  35. Villain, V.: A key tool for optimality in the state model. In: Proceedings of DIMACS Workshop on Distributed Data and Structures, pp. 133–148. Carleton University Press (1999)

Download references

Author information

Authors and Affiliations

  1. CReSTIC, Université de Reims Champagne-Ardenne, Reims, France

    Alain Bui

  2. School of Computer Science, University of Nevada, Las Vegas, USA

    Ajoy K. Datta

  3. LaRIA CNRS, Université de Picardie Jules Verne, Amiens, France

    Franck Petit & Vincent Villain

Authors
  1. Alain Bui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ajoy K. Datta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Franck Petit
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Vincent Villain
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vincent Villain.

Additional information

WARNING: The concept of snap-stabilization was first introduced in [12]. The concept evolved over the last eight years. We take this evolution in consideration in this paper, which includes the early results published in [10] and [12]. In particular, infinite repetition of computation cycles is a requirement of self-stabilizing systems. This is not required in snap-stabilization because snap-stabilization ensures that the first completed computation cycle is executed according to the specification of the problem. The correctness proofs conform to this basic property.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bui, A., Datta, A.K., Petit, F. et al. Snap-stabilization and PIF in tree networks. Distrib. Comput. 20, 3–19 (2007). https://doi.org/10.1007/s00446-007-0030-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-007-0030-4

Keywords

Search

Navigation