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

I. Abraham, D. Malkhi, and D. Ratajczak, Compact Multicast Routing, Proc. of 23rd International Symposium on Distributed Computing (DISC'09), pp.364-378, 2009.
DOI : 10.1007/978-3-642-04355-0_40

T. Bu and D. Towsley, On distinguishing between Internet power law topology generators, Proc. of IEEE INFOCOM'02, pp.638-647, 2002.

C. Magnien, M. Latapy, and M. Habib, Fast computation of empirically tight bounds for the diameter of massive graphs, Journal of Experimental Algorithmics, vol.13, issue.10, 2009.
DOI : 10.1145/1412228.1455266
URL : https://hal.archives-ouvertes.fr/hal-01146069

D. Peleg and E. Upfall, A trade-off between space and efficiency for routing tables, Journal of the ACM, vol.36, issue.3, pp.510-530, 1989.
DOI : 10.1145/65950.65953

M. Thorup and U. Zwick, Compact routing schemes, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '01, pp.1-10, 2001.
DOI : 10.1145/378580.378581

P. Pedroso, D. Papadimitriou, and D. Careglio, A name-independent compact multicast routing algorithm, available as, 2011.