Emergence of scaling in random networks, Science, vol.286, pp.509-512, 1999. ,
Data Networks, 1992. ,
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
Engineering a new algorithm for distributed shortest paths on dynamic networks. Algorithmica, to appear, pp.10-1007, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00728876
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
A speed-up technique for distributed shortest paths computation, ICCSA 2011, pp.578-593, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00644049
Engineering a new loopfree shortest paths routing algorithm, SEA 2012, pp.123-134, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00729005
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
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
Another adaptive distributed shortest path algorithm, IEEE Transactions on Communications, vol.39, issue.6, pp.995-1002, 1991. ,
DOI : 10.1109/26.87189
The CAIDA IPv4 routed/24 topology dataset ,
Adaptive routing algorithms for distributed computer networks, 1974. ,
OSPF: Anatomy of an Internet routing protocol, 1998. ,
Rethinking the service model: Scaling ethernet to a million nodes, ACM SIGCOMM HotNets, 2004. ,
Discrete event simulation environment ,
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
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
Rd: Reducing message overhead in DUAL, Proceedings 1st International Conference on Network Infrastructure and Digital Content (IC-NIDC09), pp.270-274, 2009. ,
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