Abstract
We present a generic distributed algorithm for solving silents tasks such as shortest path calculus, depth-first-search tree construction, best reliable transmitters, in directed networks where communication may be only unidirectional. Our solution is written for the asynchronous message passing communication model, and tolerates multiple kinds of failures (transient and intermittent).
First, our algorithm is self-stabilizing, so that it recovers correct behavior after finite time starting from an arbitrary global state caused by a transient fault. Second, it tolerates fair message loss, finite message duplication, and arbitrary message reordering, during both the stabilizing phase and the stabilized phase. This second property is most interesting since, in the context of unidirectional networks, there exists no self-stabilizing reliable data-link protocol. The correctness proof subsumes previous proofs for solutions in the simpler reliable shared memory communication model.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Afek, Y., Bremler, A.: Self-stabilizing unidirectional network algorithms by power supply. Chicago Journal of Theoretical Computer Science 4(3), 1–48 (1998)
Afek, Y., Brown, G.M.: Self-stabilization over unreliable communication media. Distributed Computing 7, 27–34 (1993)
Baccelli, F., Cohen, G., Olsder, G., Quadrat, J.-P.: Synchronization and Linearity, an algebra for discrete event systems. Wiley, Chichester (1992)
Cobb, J.A., Gouda, M.G.: Stabilization of routing in directed networks. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol. 2194, pp. 51–66. Springer, Heidelberg (2001)
Delaët, S., Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators in unreliable directed networks. Technical Report 1361, Laboratoire de Recherche en Informatique (April 2003)
Delaët, S., Tixeuil, S.: Tolerating transient and intermittent failures. Journal of Parallel and Distributed Computing 62(5), 961–981 (2002)
Dolev, S.: Self-stabilization. The MIT Press, Cambridge (2000)
Dolev, S., Gouda, M.G., Schneider, M.: Memory requirements for silent stabilization. Acta Informatica 36(6), 447–462 (1999)
Dolev, S., Schiller, E.: Self-stabilizing group communication in directed networks. Acta Inf. 40(9), 609–636 (2004)
Ducourthial, B.: New operators for computing with associative nets. In: Proceedings of SIROCCO 1998, Amalfi, Italia (1998)
Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators. Distributed Computing 14(3), 147–162 (2001)
Ducourthial, B., Tixeuil, S.: Self-stabilization with path algebra. Theoretical Computer Science 293(1), 219–236 (2003)
Katz, S., Perry, K.J.: Message passing extensions for self-stabilizing systems. Distributed Computing 7(1), 17–26 (1993)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delaët, S., Ducourthial, B., Tixeuil, S. (2005). Self-stabilization with r-Operators Revisited. In: Tixeuil, S., Herman, T. (eds) Self-Stabilizing Systems. SSS 2005. Lecture Notes in Computer Science, vol 3764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11577327_5
Download citation
DOI: https://doi.org/10.1007/11577327_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29814-4
Online ISBN: 978-3-540-32123-1
eBook Packages: Computer ScienceComputer Science (R0)