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

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, Engineering a new algorithm for distributed shortest paths on dynamic networks. Algorithmica
URL : https://hal.archives-ouvertes.fr/hal-00728876

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, SEA 2010, pp.59-70, 2010.
DOI : 10.1007/978-3-642-13193-6_6

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

G. D. Angelo, M. D. Emidio, D. Frigioni, and V. Maurizio, A speed-up technique for distributed shortest paths computation, ICCSA 2011, pp.578-593, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00644049

K. Elmeleegy, A. L. Cox, and T. S. Ng, On Count-to-Infinity Induced Forwarding Loops Ethernet Networks, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, pp.1-13, 2006.
DOI : 10.1109/INFOCOM.2006.229

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

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

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

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

. Omnet++, Discrete event simulation environment

A. Orda and R. Rom, Distributed shortest-path protocols for time-dependent networks, Distributed Computing, vol.10, issue.1, pp.49-62, 1996.
DOI : 10.1007/s004460050023

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

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

N. Yao, E. Gao, Y. Qin, and H. Zhang, Rd: Reducing message overhead in DUAL, Proceedings 1st International Conference on Network Infrastructure and Digital Content (IC-NIDC09), pp.270-274, 2009.

C. Zhao, Y. Liu, and K. Liu, A More Efficient Diffusing Update Algorithm For Loop-Free Routing, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing, pp.1-4, 2009.
DOI : 10.1109/WICOM.2009.5302468