Abstract
Starting from any configuration, a snap-stabilizing protocol guarantees that the system always behaves according to its specification while a self-stabilizing protocol only guarantees that the system will behave according to its specification in a finite time. So, a snap-stabilizing protocol is a time optimal self-stabilizing protocol (because it stabilizes in 0 rounds). That property is very suitable in the case of systems that are prone to transient faults. There exist a lot of approaches of the concept of self-stabilization, but to our knowledge, snap-stabilization is the only variant of self-stabilization which has been proved power equivalent to self-stabilization in the context of the state model (a locally shared memory model) and for non anonymous systems. So the problem of the existence of snap-stabilizing solutions in the message passing model is a very crucial question from a practical point of view. In this paper, we present the first snap-stabilizing propagation of information with feedback (PIF) protocol for non-oriented trees in the message passing model. Moreover using slow and fast timers, the round complexity of our algorithm is in θ(h ×k) and θ((h ×k) + k 2), respectively, where h is the height of the tree and k is the maximal capacity of the channels. We conjecture that our algorithm is optimal.
This is a preview of subscription content, log in via an institution to check access.
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
Afek, Y., Brown, G.M.: Self-stabilization over unreliable communication media. Distributed Computing 7(1), 27–34 (1993)
Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction (extended abstract). In: 32nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 268–277. IEEE Computer Society (1991)
Blin, L., Cournier, A., Villain, V.: An improved snap-stabilizing PIF algorithm. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol. 2704, pp. 199–214. Springer, Heidelberg (2003)
Bui, A., Datta, A.K., Petit, F., Villain, V.: State-optimal snap-stabilizing pif in tree networks. In: Workshop on Self-stabilizing Systems (WSS), pp. 78–85. IEEE Computer Society (1999)
Bui, A., Datta, A.K., Petit, F., Villain, V.: Snap-stabilizing pif algorithm in the tree networks without sense of direction. In: SIROCCO 1999, 6th International Colloquium on Structural Information & Communication Complexity, Lacanau-Ocean, France, July 1-3, pp. 32–46. Carleton Scientific (1999)
Bui, A., Datta, A.K., Petit, F., Villain, V.: Snap-stabilization and pif in tree networks. Distributed Computing 20(1), 3–19 (2007)
Chang, E.J.H.: Echo algorithms: Depth parallel operations on general graphs. IEEE Trans. Software Eng. 8(4), 391–401 (1982)
Cournier, A., Datta, A.K., Petit, F., Villain, V.: Snap-stabilizing pif algorithm in arbitrary networks. In: 22nd International Conference on Distributed Computing Systems (ICDCS), pp. 199–208 (2002)
Cournier, A., Datta, A.K., Petit, F., Villain, V.: Optimal snap-stabilizing pif in un-oriented trees. In: Proceedings of the 5th International Conference on Principles of Distributed Systems OPODIS 2001, Manzanillo, Mexico, December 10-12, pp. 71–90. Studia Informatica Universalis (2001)
Cournier, A., Datta, A.K., Petit, F., Villain, V.: Enabling snap-stabilization. In: 23rd International Conference on Distributed Computing Systems (ICDCS 2003), Providence, RI, USA, May 19-22, pp. 12–19. IEEE Computer Society (2003)
Cournier, A., Datta, A.K., Petit, F., Villain, V.: Optimal snap-stabilizing pif algorithms in un-oriented trees. J. High Speed Networks 14(2), 185–200 (2005)
Cournier, A., Devismes, S., Villain, V.: From self- to snap- stabilization. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol. 4280, pp. 199–213. Springer, Heidelberg (2006)
Cournier, A., Devismes, S., Villain, V.: Snap-stabilizing pif and useless computations. In: 12th International Conference on Parallel and Distributed Systems (ICPADS 2006), Minneapolis, Minnesota, USA, July 12-15, pp. 39–48. IEEE Computer Society (2006)
Cournier, A., Devismes, S., Villain, V.: Light enabling snap-stabilization of fundamental protocols. TAAS 4(1), 1–27 (2009)
Delaët, S., Devismes, S., Nesterenko, M., Tixeuil, S.: Snap-stabilization in message-passing systems. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds.) ICDCN 2009. LNCS, vol. 5408, pp. 281–286. Springer, Heidelberg (2008)
Devismes, S., Petit, F., Villain, V.: Autour de l’autostabilisation 1. techniques généralisant l’approche. Technique et Science Informatiques 30(7), 873–894 (2011)
Devismes, S., Petit, F., Villain, V.: Autour de l’autostabilisation 2. techniques spécialisant l’approche. Technique et Science Informatiques 30(7), 895–922 (2011)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974)
Dolev, S., Tzachar, N.: Empire of colonies: Self-stabilizing and self-organizing distributed algorithms. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 230–243. Springer, Heidelberg (2006)
Segall, A.: Distributed network protocols. IEEE Transactions on Information Theory 29(1), 23–34 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Levé, F., Mohamed, K., Villain, V. (2014). Snap-Stabilizing PIF on Non-oriented Trees and Message Passing Model. In: Felber, P., Garg, V. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2014. Lecture Notes in Computer Science, vol 8756. Springer, Cham. https://doi.org/10.1007/978-3-319-11764-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-11764-5_21
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11763-8
Online ISBN: 978-3-319-11764-5
eBook Packages: Computer ScienceComputer Science (R0)