R. Albert and A. Barabási, Emergence of scaling in random networks, Science, vol.286, pp.509-512, 1999.

R. Albert and A. Barabási, Statistical mechanics of complex networks, Reviews of Modern Physics, vol.74, issue.1, pp.47-97, 2002.
DOI : 10.1103/RevModPhys.74.47

H. Attiya and J. Welch, Distributed Computing, 2004.
DOI : 10.1002/0471478210

B. Awerbuch, A. Bar-noy, and M. Gopal, Approximate distributed Bellman-Ford algorithms, IEEE Transactions on Communications, vol.42, issue.8, pp.2515-2517, 1994.
DOI : 10.1109/26.310604

D. Bertsekas and R. Gallager, Data Networks, 1992.

B. Bollobás, Random Graphs, 2001.

S. Cicerone, G. D. Angelo, G. D. Stefano, and D. Frigioni, Partially dynamic efficient algorithms for distributed shortest paths, Theoretical Computer Science, vol.411, issue.7-9, pp.1013-1037, 2010.
DOI : 10.1016/j.tcs.2009.11.008

S. Cicerone, G. D. Angelo, G. D. Stefano, D. Frigioni, and V. Maurizio, A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation, Proceedings of the 9th International Symposium on Experimental Algorithms, pp.59-70, 2010.
DOI : 10.1007/978-3-642-13193-6_6

S. Cicerone, G. D. Angelo, G. D. Stefano, D. Frigioni, and A. Petricola, Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation, Journal of Computers, vol.2, issue.9, pp.16-26, 2007.
DOI : 10.4304/jcp.2.9.16-26
URL : http://doi.org/10.4304/jcp.2.9.16-26

S. Cicerone, G. D. Stefano, D. Frigioni, and U. Nanni, A fully dynamic algorithm for distributed shortest paths, Theoretical Computer Science, vol.297, issue.1-3, pp.83-102, 2003.
DOI : 10.1016/S0304-3975(02)00619-9

D. Frigioni, A. Marchetti-spaccamela, and U. Nanni, Fully Dynamic Algorithms for Maintaining Shortest Paths Trees, Journal of Algorithms, vol.34, issue.2, pp.251-281, 2000.
DOI : 10.1006/jagm.1999.1048

J. J. Garcia-lunes-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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.9534

P. A. Humblet, Another adaptive distributed shortest path algorithm, IEEE Transactions on Communications, vol.39, issue.6, pp.995-1002, 1991.
DOI : 10.1109/26.87189

Y. Hyun, B. Huffaker, D. Andersen, E. Aben, C. Shannon et al., The CAIDA IPv4 routed/24 topology dataset

G. F. Italiano, Distributed algorithms for updating shortest paths, Proceedings of the International Workshop on Distributed Algorithms, pp.200-211, 1991.
DOI : 10.1007/BFb0022448

J. Mcquillan, Adaptive routing algorithms for distributed computer networks, 1974.

J. T. Moy, OSPF -Anatomy of an Internet routing protocol, 1998.

P. Narváez, K. Siu, and H. Tzeng, New dynamic algorithms for shortest path tree computation, IEEE/ACM Transactions on Networking, vol.8, issue.6, pp.734-746, 2000.
DOI : 10.1109/90.893870

A. Orda and R. Rom, Distributed shortest-path and minimum-delay protocols in networks with time-dependent edge-length. Distributed Computing, pp.49-62, 1996.

K. V. Ramarao and S. Venkatesan, On finding and updating shortest paths distributively, Journal of Algorithms, vol.13, issue.2, pp.235-257, 1992.
DOI : 10.1016/0196-6774(92)90017-7

S. Ray, R. Guérin, K. Kwong, and R. Sofia, Always Acyclic Distributed Path Computation, IEEE/ACM Transactions on Networking, vol.18, issue.1, pp.307-319, 2010.
DOI : 10.1109/TNET.2009.2025374
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.3129

E. C. Rosen, The updating protocol of ARPANET's new routing algorithm, Computer Networks (1976), vol.4, issue.1, pp.11-19, 1980.
DOI : 10.1016/0376-5075(80)90025-2

J. Wu, F. Dai, X. Lin, J. Cao, and W. Jia, An extended fault-tolerant link-state routing protocol in the internet, IEEE Transactions on Computers, vol.52, issue.10, pp.1298-1311, 2003.