M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the internet topology, ACM SIGCOMM Conference, pp.251-262, 1999.

I. Abraham, D. Malkhi, and O. Dobzinski, LAND: stretch 1+? localityaware networks for DHTs, 15th ACM-SIAM Symposium on Discrete algorithm (SODA), pp.550-559, 2004.

M. Thorup and U. Zwick, Approximate distance oracles, 33rd ACM Symposium on Theory of Computing (STOC), pp.183-192, 2001.
DOI : 10.1145/1044731.1044732
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.4480

D. V. Krioukov, K. R. Fall, and X. Yang, Compact routing on internet-like graphs, IEEE INFOCOM 2004, 2004.
DOI : 10.1109/INFCOM.2004.1354495
URL : http://arxiv.org/abs/cond-mat/0308288

H. T. Chan and A. Gupta, Small hop-diameter sparse spanners for doubling metrics, 17th ACM-SIAM Symposium on Discrete algorithm (SODA), pp.70-78, 2006.
DOI : 10.1007/s00454-008-9115-5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.850

P. Francis, S. Jamin, C. Jin, Y. Jin, D. Raz et al., IDMaps: a global Internet host distance estimation service, IEEE/ACM Transactions on Networking, vol.9, issue.5, pp.525-540, 2001.
DOI : 10.1109/90.958323
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.6517

D. R. Karger and M. , Finding nearest neighbors in growthrestricted metrics, 34th ACM Symposium on Theory of Computing (STOC), pp.741-750, 2002.

T. S. Ng and H. Zhang, Predicting Internet network distance with coordinates-based approaches, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002.
DOI : 10.1109/INFCOM.2002.1019258

C. G. Plaxton, R. Rajaraman, and A. W. Richa, Accessing nearby copies of replicated objects in a distributed environment, Theory of Computing Systems, pp.241-280, 1999.

A. Gupta, R. Krauthgamer, and J. R. Lee, Bounded geometries, fractals, and low-distortion embeddings Distance estimation and object location via rings of neighbors, Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS) 24th ACM Symposium on Principles of Distributed Computing (PODC), pp.534-575, 2003.

I. Abraham, C. Gavoille, A. V. Goldberg, and D. Malkhi, Routing in Networks with Low Doubling Dimension, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06), p.75, 2006.
DOI : 10.1109/ICDCS.2006.72
URL : https://hal.archives-ouvertes.fr/hal-00400501

K. Hildrum, R. Krauthgamer, and J. Kubiatowicz, Object location in realistic networks, Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures , SPAA '04, pp.25-35, 2004.
DOI : 10.1145/1007912.1007918

G. Konjevod, A. Richa, and D. Xia, Optimal-stretch name-independent compact routing in doubling metrics, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.198-207, 2006.
DOI : 10.1145/1146381.1146412

G. Konjevod, A. Richa, D. Xia, and H. Yu, Compact routing schemes with relaxed guarantees for networks of low doubling dimension, 26th ACM Symposium on Principles of Distributed Computing (PODC), 2007.

E. W. Zegura, K. L. Calvert, and S. Bhattacharjee, How to model an internetwork, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications, pp.594-602, 1996.
DOI : 10.1109/INFCOM.1996.493353

B. Huffaker, M. Fomenkov, D. Moore, and K. C. Claffy, Macroscopic analyses of the infrastructure: Measurement and visualization of internet connectivity and performance, 2nd Workshop on Passive and Active Measurements, 2001.

B. Zhang, T. S. Ng, A. Nandi, R. Riedi, P. Druschel et al., Measurement based analysis, modeling, and synthesis of the internet delay space, Proceedings of the 6th ACM SIGCOMM on Internet measurement , IMC '06, pp.85-98, 2006.
DOI : 10.1145/1177080.1177091

S. Banerjee, T. Griffin, and M. Pias, The Interdomain Connectivity of PlanetLab Nodes, 5th Workshop on Passive and Active Measurements, pp.73-82, 2004.
DOI : 10.1007/978-3-540-24668-8_8

S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson, The end-to-end effects of internet path selection, ACM SIGCOMM Conference, 2002.

J. M. Kleinberg, A. Slivkins, and T. Wexler, Triangulation and embedding using small sets of beacons, 45th Symposium on Foundations of Computer Science (FOCS), pp.444-453, 2004.
DOI : 10.1109/focs.2004.70
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.9860

A. Slivkins, Distributed approaches to triangulation and embeddings Skitter project, 16th ACM-SIAM Symposium on Discrete algorithm (SODA), 2004.

B. Wong, A. Slivkins, and E. G. Sirer, Meridian: a lightweight network location service without virtual coordinates, ACM SIGCOMM Conference, pp.85-96, 2005.

T. M. Gil, F. Kaashoek, J. Li, R. Morris, and J. Stribling, P2psim: a simulator for peer-to-peeer protocols All sites pings for planetlab

H. T. Chan, A. Gupta, B. M. Maggs, and S. Zhou, On Hierarchical Routing in Doubling Metrics, 16th ACM-SIAM symposium on Discrete algorithms (SODA), pp.762-771, 2005.
DOI : 10.1145/2915183

P. K. Gummadi, S. Saroiu, and S. D. Gribble, King, ACM SIGCOMM Computer Communication Review, vol.32, issue.3, p.11, 2002.
DOI : 10.1145/571697.571700

F. Dabek, R. Cox, M. F. Kaashoek, and R. Morris, Vivaldi: a decentralized network coordinate system, ACM SIGCOMM Conference, pp.15-26, 2004.

I. Abraham, B. Awerbuch, Y. Azar, Y. Bartal, D. Malkhi et al., A generic scheme for building overlay networks in adversarial scenarios, Proceedings International Parallel and Distributed Processing Symposium, 2003.
DOI : 10.1109/IPDPS.2003.1213125

P. Fraigniaud and P. Gauron, D2B: A de Bruijn based content-addressable network, Theoretical Computer Science, vol.355, issue.1, pp.65-79, 2006.
DOI : 10.1016/j.tcs.2005.12.006
URL : http://doi.org/10.1016/j.tcs.2005.12.006

M. Naor and U. Wieder, Novel architectures for P2P applications: the continuous-discrete approach, 15th ACM Symposium on Parallel Algorithms (SPAA), pp.50-59, 2003.

D. V. Krioukov, K. Claffy, K. Fall, and A. Brady, On compact routing for the internet, ACM SIGCOMM Computer Communication Review, vol.37, issue.3, 2007.
DOI : 10.1145/1273445.1273450

P. Assouad, Plongements lipschitzien dans Ê n, Bulletin de la Société Mathématique de France, pp.429-448, 1983.
DOI : 10.24033/bsmf.1997
URL : http://archive.numdam.org/article/BSMF_1983__111__429_0.pdf