E. Anagnostou and V. Hadzilacos, Tolerating transient and permanent failures (extended abstract), Lecture Notes in Computer Science, vol.725, pp.174-188, 1993.
DOI : 10.1007/3-540-57271-6_35

M. Ben-or, D. Dolev, and E. N. Hoch, Fast self-stabilizing byzantine tolerant digital clock synchronization, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.385-394, 2008.
DOI : 10.1145/1400751.1400802

J. A. , C. , and M. G. Gouda, Stabilization of general loop-free routing, J. Parallel Distrib. Comput, vol.62, issue.5, pp.922-944, 2002.

A. Kumar-datta, S. Gurumurthy, F. Petit, and V. Villain, Selfstabilizing network orientation algorithms in arbitrary rooted networks, Stud. Inform. Univ, vol.1, issue.1, pp.1-22, 2001.

W. Edsger and . Dijkstra, Self-stabilizing systems in spite of distributed control, Commun. ACM, vol.17, issue.11, pp.643-644, 1974.

S. Dolev, Self Stabilization, Journal of Aerospace Computing, Information, and Communication, vol.1, issue.6, 2000.
DOI : 10.2514/1.10141
URL : https://hal.archives-ouvertes.fr/inria-00627780

S. Dolev and T. Herman, SuperStabilizing protocols for dynamic distributed systems, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing , PODC '95, 1997.
DOI : 10.1145/224964.224993

S. Dolev and J. L. Welch, Wait-Free Clock Synchronization, Algorithmica, vol.18, issue.4, pp.486-511, 1997.
DOI : 10.1007/PL00009167

S. Dolev and J. L. Welch, Self-stabilizing clock synchronization in the presence of Byzantine faults, Journal of the ACM, vol.51, issue.5, pp.780-799, 2004.
DOI : 10.1145/1017460.1017463

M. Eli, P. Gafni, and . Bertsekas, Distributed algorithms for generating loop-free routes in networks with frequently changing topology, IEEE Transactions on Communications, vol.29, pp.11-18, 1981.

R. G. Gallager, P. A. Humblet, and P. M. Spira, A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Transactions on Programming Languages and Systems, vol.5, issue.1, pp.66-77, 1983.
DOI : 10.1145/357195.357200

J. J. Garcia-luna-aceves, Loop-free routing using diffusing computations, IEEE/ACM Transactions on Networking, vol.1, issue.1, pp.130-141, 1993.
DOI : 10.1109/90.222913

S. Ajei, K. J. Gopal, and . Perry, Unifying self-stabilization and fault-tolerance (preliminary version), PODC, pp.195-206, 1993.

G. Mohamed, T. Gouda, and . Herman, Adaptive programming, IEEE Trans. Software Eng, vol.17, issue.9, pp.911-921, 1991.

G. Mohamed, M. Gouda, and . Schneider, Stabilization of maximal metric trees, pp.10-17, 1999.

K. S. Sandeep, P. K. Gupta, and . Srimani, Self-stabilizing multicast protocols for ad hoc networks, J. Parallel Distrib. Comput, vol.63, issue.1, pp.87-96, 2003.

L. Higham and Z. Liang, Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks, DISC, pp.194-208, 2001.
DOI : 10.1007/3-540-45414-4_14

C. Johnen and S. Tixeuil, Route Preserving Stabilization, Self-Stabilizing Systems, pp.184-198, 2003.
DOI : 10.1007/3-540-45032-7_14

J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society, vol.7, issue.1, pp.48-50, 1956.
DOI : 10.1090/S0002-9939-1956-0078686-7

M. Papatriantafilou and P. Tsigas, On Self-Stabilizing Wait-Free Clock Synchronization, Parallel Processing Letters, vol.07, issue.03, pp.321-328, 1997.
DOI : 10.1142/S0129626497000334

F. Petit and V. Villain, Optimal snap-stabilizing depth-first token circulation in tree networks, Journal of Parallel and Distributed Computing, vol.67, issue.1, pp.1-12, 2007.
DOI : 10.1016/j.jpdc.2006.08.008

R. C. Prim, Shortest Connection Networks And Some Generalizations, Bell System Technical Journal, vol.36, issue.6, pp.1389-1401, 1957.
DOI : 10.1002/j.1538-7305.1957.tb01515.x

D. D. Sleator and R. E. Tarjan, A data structure for dynamic trees, Proceedings of the thirteenth annual ACM symposium on Theory of computing , STOC '81, pp.362-391, 1983.
DOI : 10.1145/800076.802464