A. Acd-+-17-]-karine-altisen, S. Cournier, A. Devismes, F. Durand, and . Petit, Self-stabilizing leader election in polynomial steps, Information and Computation, vol.254, pp.330-366, 2017.
DOI : 10.1016/j.ic.2016.09.002

K. Altisen, S. Devismes, A. Durand, and F. Petit, Gradual Stabilization Under $$\tau $$ -Dynamics, Euro-Par 2016: Parallel Processing -22nd International Conference on Parallel and Distributed Computing Proceedings, volume 9833 of Lecture Notes in Computer Science, pp.588-602, 2016.
DOI : 10.1109/IPCCC.2001.918656

A. Arora, T. Gouda, and . Herman, Composite routing protocols, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990, pp.70-78, 1990.
DOI : 10.1109/SPDP.1990.143510

C. I. Abraham, D. Gavoille, N. Malkhi, M. Nisan, and . Thorup, Compact name-independent routing with minimum stretch, ACM Transactions on Algorithms, vol.4, issue.3, p.37, 2008.
DOI : 10.1145/1007912.1007916
URL : https://hal.archives-ouvertes.fr/hal-00368010

[. Blin, A. Cournier, and V. Villain, An Improved Snap-Stabilizing PIF Algorithm, Self-Stabilizing Systems, 6th International Symposium, SSS 2003, pp.199-214, 2003.
DOI : 10.1007/3-540-45032-7_15
URL : https://hal.archives-ouvertes.fr/hal-01310823

[. Bein, A. Kumar-datta, and V. Villain, Self-Stabilizing Local Routing in Ad Hoc Networks, The Computer Journal, vol.50, issue.2, pp.197-203, 2007.
DOI : 10.1093/comjnl/bxl059

[. Bellman, On a routing problem, Quarterly of Applied Mathematics, vol.16, issue.1, pp.87-90, 1958.
DOI : 10.1090/qam/102435

M. [. Blin, S. Potop-butucaru, S. Rovedakis, and . Tixeuil, Loop-Free Super-Stabilizing Spanning Tree Construction, the 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'10), Springer LNCS 6366, pp.50-64, 2010.
DOI : 10.1007/978-3-540-92221-6_31
URL : https://hal.archives-ouvertes.fr/hal-00668381

A. Carrier, S. Kumar-datta, L. L. Devismes, Y. Larmore, and . Rivierre, Self-stabilizing (f,g)-Alliances with Safe Convergence, J. Parallel Distrib. Comput, pp.81-8211, 2015.
DOI : 10.1007/978-3-319-03089-0_5
URL : http://www-verimag.imag.fr/%7Edevismes/WWW/rapports/fga.pdf

A. Cournier, S. Devismes, F. Petit, and V. Villain, Snap-Stabilizing Depth-First Search on Arbitrary Networks, The Computer Journal, vol.49, issue.3, pp.268-280, 2006.
DOI : 10.1093/comjnl/bxh154
URL : http://www-verimag.imag.fr/~devismes/WWW/rapports/opodis04.pdf

A. Cournier, S. Devismes, and V. Villain, A Snap-Stabilizing DFS with a Lower Space Requirement, Symposium on Self-Stabilizing Systems, pp.33-47, 2005.
DOI : 10.1007/11577327_3

A. Cournier, S. Devismes, and V. Villain, Light enabling snap-stabilization of fundamental protocols, ACM Transactions on Autonomous and Adaptive Systems, vol.4, issue.1, 2009.
DOI : 10.1145/1462187.1462193

M. [. Cobb and . Gouda, Stabilization of General Loop-Free Routing, Journal of Parallel and Distributed Computing, vol.62, issue.5, pp.922-944, 2002.
DOI : 10.1006/jpdc.2001.1830

C. [. Cobb and . Huang, Stabilization of Maximal-Metric Routing without Knowledge of Network Size, 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies, pp.306-311, 2009.
DOI : 10.1109/PDCAT.2009.75

J. H. Ernest and . Chang, Echo Algorithms: Depth Parallel Operations on General Graphs, IEEE Trans. Software Eng, vol.8, issue.4, pp.391-401, 1982.

A. Cournier, A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm, International Colloquium on Structural Information and Communication Complexity, pp.141-153, 2009.
DOI : 10.1109/71.588622

A. Cournier, S. Rovedakis, and V. Villain, The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction, the 15th International Conference on Principles of Distributed Systems (OPODIS'11), Springer LNCS 7109, pp.159-174, 2011.
DOI : 10.1017/CBO9781139168724
URL : https://hal.archives-ouvertes.fr/hal-01009450

[. Chandrasekar, K. Pradip, and . Srimani, A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM, Parallel Algorithms and Applications, vol.39, issue.1-2, pp.125-137, 1994.
DOI : 10.1145/151254.151256

N. Chen, S. Yu, and . Huang, A self-stabilizing algorithm for constructing spanning trees, Information Processing Letters, vol.39, issue.3, pp.147-151, 1991.
DOI : 10.1016/0020-0190(91)90111-T

A. Kumar-datta, S. Devismes, and L. L. Larmore, Brief announcement: Self-stabilizing silent disjunction in an anonymous network, the 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'12), Springer LNCS 7596, pp.46-48, 2012.

A. Kumar-datta, S. Devismes, and L. L. Larmore, Self-stabilizing silent disjunction in an anonymous network, 14th International Conference on Distributed Computing and Networking (ICDCN 2013), Springer LNCS 7730, pp.148-160, 2013.

S. Dolev, M. G. Gouda, and M. Schneider, Memory requirements for silent stabilization, Acta Informatica, vol.36, issue.6, pp.447-462, 1999.
DOI : 10.1007/s002360050180
URL : http://www.cs.utexas.edu/~gouda/papers/journal/JA9.pdf

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
DOI : 10.1145/224964.224993
URL : ftp://ftp.cs.uiowa.edu/pub/selfstab/DH95.ps.gz

W. Edsger and . Dijkstra, Self-stabilizing Systems in Spite of Distributed Control, Commun. ACM, vol.17, issue.11, pp.643-644, 1974.

[. Devismes, D. Ilcinkas, C. Johnen, S. Dolev, S. Israeli et al., Self-stabilizing disconnected components detection and rooted shortest-path tree maintenance in polynomial steps, 20th International Conference on Principles of Distributed Systems Self-stabilization of dynamic systems assuming only Read/Write atomicity. Distributed Computing, pp.3-16, 1993.
URL : https://hal.archives-ouvertes.fr/hal-01544581

S. Devismes and C. Johnen, Silent self-stabilizing BFS tree algorithms revisited, Journal of Parallel and Distributed Computing, vol.97, pp.11-23, 2016.
DOI : 10.1016/j.jpdc.2016.06.003
URL : https://hal.archives-ouvertes.fr/hal-01411862

A. Kumar-datta, L. L. Larmore, and H. Piniganti, Self-stabilizing leader election in dynamic networks, the 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'10), Springer LNCS 6366, pp.35-49, 2010.

K. Ajoy, L. L. Datta, P. Larmore, and . Vemula, An o(n)-time self-stabilizing leader election algorithm. jpdc, pp.711532-1544, 2011.

A. Kumar-datta, L. L. Larmore, and P. Vemula, Self-stabilizing leader election in optimal space under an arbitrary scheduler, Theoretical Computer Science, vol.412, issue.40, pp.5541-5561, 2011.
DOI : 10.1016/j.tcs.2010.05.001

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

R. F. Lester and . Jr, Network flow theory, Paper P-923), 1956.

C. Ga16, N. Glacet, and . Hanusse, Disconnected components detection and rooted shortest-path tree maintenance in networks -extended version, 2016.

C. Gavoille, C. Glacet, N. Hanusse, and D. Ilcinkas, On the Communication Complexity of Distributed Name-Independent Routing Schemes, the 27th International Symposium on Distributed Computing (DISC'13), Springer LNCS 8205, pp.418-432, 2013.
DOI : 10.1007/978-3-642-41527-2_29
URL : https://hal.archives-ouvertes.fr/hal-00851217

[. Glacet, N. Hanusse, D. Ilcinkas, and C. Johnen, Disconnected components detection and rooted shortest-path tree maintenance in networks, the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'14), Springer LNCS 8736, pp.120-134, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01352245

C. Felix and . Gärtner, A survey of self-stabilizing spanning-tree construction algorithms, Swiss Federal Institute of Technolog, 2003.

. Shing-tsaan, N. Huang, and . Chen, A self-stabilizing algorithm for constructing breadth-first trees, Information Processing Letters, vol.41, issue.2, pp.109-117, 1992.

L. Charles and . Hedrick, Routing information protocol, 1988.

C. Tetz, J. Huang, and . Lin, A self-stabilizing algorithm for the shortest path problem in a distributed system, Computers & Mathematics with Applications, vol.43, issue.1, pp.103-109, 2002.

C. Tetz and . Huang, A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity, Journal of Computer System Sciences, vol.71, issue.1, pp.70-85, 2005.

C. Tetz and . Huang, A self-stabilizing algorithm for the shortest path problem assuming the distributed demon, Computers & Mathematics with Applications, vol.50, pp.5-6671, 2005.

C. Johnen and F. Mekhaldi, Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters, Journal of Parallel and Distributed Computing, vol.74, issue.1, pp.1900-1913, 2014.
DOI : 10.1016/j.jpdc.2013.09.004
URL : https://hal.archives-ouvertes.fr/hal-00939445

S. [. Johnen and . Tixeuil, Route Preserving Stabilization, the 6th International Symposium on Self-stabilizing System (SSS'03), Springer LNCS 2704, pp.184-198, 2003.
DOI : 10.1007/3-540-45032-7_14

A. Kosowski and L. Kuszner, A Self-stabilizing Algorithm for Finding a??Spanning Tree in a Polynomial Number of Moves, 6th International Conference Parallel Processing and Applied Mathematics, (PPAM'05), Springer LNCS 3911, pp.75-82, 2005.
DOI : 10.1007/11752578_10

A. Leon-garcia and I. Widjaja, Communication Networks, 2004.

[. Rekhter, S. Li, and . Hares, Rfc 4271: Border gateway protocol 4, 2006.

A. Segall, Distributed network protocols, IEEE Transactions on Information Theory, vol.29, issue.1, pp.23-34, 1983.
DOI : 10.1109/TIT.1983.1056620

[. Sloman and J. Kramer, Distributed systems and computer networks, 1987.

G. Tel, Introduction to distributed algorithms, 2001.
DOI : 10.1017/CBO9781139168724