Self-stabilization with path algebra

Theoretical Computer Science

Volumn 293, Issue 1, 2003, Pages 219-236

  Ducourthial, Bertrand ^a   Tixeuil, Sébastien ^b  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

^b Laboratoire Interdisciplinaire des Sciences du Numérique   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; ITERATIVE METHODS; REDUNDANCY; ROBUSTNESS (CONTROL SYSTEMS);

SELF-STABILIZATION;

ALGEBRA;

EID: 0037415375     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00238-4     Document Type: Conference Paper

References (33)

1. Y. Afek, A. Bremler, Self-Stabilizing Unidirectional Network Algorithms by Power Supply, MIT Press, Cambridge, MA, 1998; Chicago J. Theoret. Comput. Sci. 3 (1998).
2. Y. Afek, A. Bremler, Self-Stabilizing Unidirectional Network Algorithms by Power Supply, MIT Press, Cambridge, MA, 1998; Chicago J. Theoret. Comput. Sci. 3 (1998).
3. Y. Afek, S. Kutten, M. Yung, Memory-efficient self-stabilization on general networks, Proc. WDAG'90, 1990, pp. 15-28.
4. L.O. Alima, J. Beauquier, A.K. Datta, S. Tixeuil, Self-stabilization with global rooted synchronizers, Proc. ICDCS'98, 1998.
5. Arora A., Attie P., Evangelist M., Gouda M.G. Convergence of iteration systems. Distributed Comput. 7:1993;43-53.
6. B. Awerbuch, B. Patt-Shamir, G. Varghese, Self-stabilization by local checking and correction, Proc. FOCS'91, Los Alamitos, CA, October 1991, pp. 268-277.
7. B. Awerbuch, B. Patt-Shamir, G. Varghese, S. Dolev, Self-stabilization by local checking and global reset, in: Internat. Workshop on Distributed Algorithms, Berlin, 1994, pp. 326-339.
8. Baccelli F., Cohen G., Olsder G., Quadrat J.-P. Synchronisation and Linearity, an Algebra for Discrete Event Systems. Series in Probability and Mathematical Statistics. 1992;Wiley, Chichester, UK.
9. Baudet G.M. Asynchronous iterative methods for multiprocessors. J. ACM. 25(2):1978;226-244.
10. A. Costello, G. Varghese, Self-stabilization by window washing, Proc. PODC'96, 1996, pp. 35-44.
11. Das S.K., Datta A.K., Tixeuil S. Self-stabilizing algorithms on DAG structured networks. Parallel Processing Letters. 9:1999;563-574.
12. Dijkstra E.W. Self-stabilizing systems in spite of distributed control. Commun. ACM. 17(11):1974;643-644.
13. S. Dolev, G. Gouda, M. Schneider, Memory requirements for silent stabilization, Proc. PODC'96, 1996, pp. 27-34.
14. S. Dolev, T. Herman, Superstabilizing Protocols for Dynamic Distributed Systems, MIT Press, Cambridge, MA, 1997; Chicago J. Theoret. Comput. Sci. 4 (1997).
15. S. Dolev, T. Herman, Superstabilizing Protocols for Dynamic Distributed Systems, MIT Press, Cambridge, MA, 1997; Chicago J. Theoret. Comput. Sci. 4 (1997).
16. Dolev S., Israeli A., Moran S. Self stabilization of dynamic systems assuming only read/write atomicity. Distributed Comput. 7:1993;3-16.
17. Dolev S., Israeli A., Moran S. Resource bounds for self-stabilizing message-driven protocols. SIAM J. Comput. 26:1997;273-290.
18. S. Dolev, D.K. Pradhan, J.L. Welch, Modified tree structure for location management in mobile environments, Proc. INFOCOM'95, vol. 2, 1995, pp. 530-537.
19. B. Ducourthial, New operators for computing with associative nets, Proc. SIROCCO'98, Amalfi, Italia, 1998.
20. B. Ducourthial, Les Réseaux Associatifs (Associative nets), Ph.D. Thesis, Université de Paris Sud, France, January 1999.
21. Ducourthial B., Tixeuil S. Self-stabilization with r-operators Distributed Computing. 14:2001;147-162.
22. Gondran M. Algèbre linéaire et cheminement dans un graphe. RAIRO, Inform. Théorique. 9(1):1975;77-99.
23. M. Gondran, M. Minoux, Graphes et Algorithmes, No. 37 in Collection de la DER de EDF, Eyrolles, 1979, Also published as Graphs and Algorithms, Wiley, New York, 1986.
24. A. Israeli, M. Jalfon, Uniform Self-Stabilizing Ring Orientation, Information and Computation, vol. 104, Academic Press, New York, 1993, pp. 175-196.
25. M. Jayaram, G. Varghese, Crash failures can drive protocols to arbitrary states, Proc. PODC'96, 1996, pp. 247-256.
26. Minoux M. Structure algébrique généralisée des problèmes de cheminement dans les graphes: théorèmes, algorithmes et applications. Rech. Opér. RAIRO. 10(2):1976.
27. Schneider M. Self-stabilization. ACM Computing Surveys. 25:1993;45-67.
28. Tel G. Topics in Distributed Algorithms. Cambridge International Series on Parallel Computation. vol. 1:1991;Cambridge University Press, Cambridge.
29. Tel G. Introduction to Distributed Algorithms. 1994;Cambridge University Press, Cambridge.
30. Tsai M.-S., Huang S.-T. A self-stabilizing algorithm for the shortest paths problem with a fully distributed demon. Parallel Process. Lett. 4(1&2):1994;65-72.
31. Üresin A., Dubois M. Sufficient conditions for the convergence of asynchronous iterations. Parallel Comput. 10:1989;83-92.
32. Üresin A., Dubois M. Parallel asynchronous algorithms for discrete data. J. ACM. 37(3):1990;588-606.
33. Dolev S. Self-Stabilization. 2000;MIT Press, Cambridge, MA.