Compact name-independent routing with minimum stretch Compact routing on power law graphs with additive stretch, 8th Workshop on Algorithm Engineering and Experiments (ALENEX), pp.37-119, 2006. ,
The Average Distance in a Random Graph with Given Expected Degrees, Internet Mathematics, vol.1, issue.1, pp.91-113, 2003. ,
DOI : 10.1080/15427951.2004.10129081
A compact routing scheme and approximate distance oracle for power-law graphs, A4, 2012. [FG01] P. Fraigniaud and C. Gavoille. Routing in trees. 28th International Colloquium on Automata, Languages and Programming (ICALP), pp.757-772, 2001. ,
DOI : 10.1145/2390176.2390180
On the Communication Complexity of Distributed Name-Independent Routing Schemes, 27th International Symposium on Distributed Computing (DISC), pp.418-432, 2013. ,
DOI : 10.1007/978-3-642-41527-2_29
URL : https://hal.archives-ouvertes.fr/hal-00851217
Brief Announcement, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, 2015. ,
DOI : 10.1145/2767386.2767449
URL : https://hal.archives-ouvertes.fr/hal-00369655
HDLBR: A name-independent compact routing scheme for power-law networks, Computer Communications, vol.36, issue.3, pp.351-359, 2013. ,
DOI : 10.1016/j.comcom.2012.09.009
Internet topology at the router and autonomous system level. ArXiv preprint, 2002. ,