I. Abraham, C. Gavoille, D. Malkhi, N. Nisan, and M. Thorup, Compact nameindependent routing with minimum stretch, 16 th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), pp.20-24, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00307619

I. Abraham and D. Malkhi, Name independent routing for growth bounded networks, 17 th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), pp.49-55, 2005.

L. Barrì-ere, P. Fraigniaud, E. Kranakis, and D. Krizanc, Efficient routing in networks with long range contacts, Proceedings of 15th International Symposium on Distributed Computing (DISC '01), vol.2180, pp.270-284, 2001.

P. Bose and P. Morin, Online routing in triangulations, SIAM J. Comput, vol.33, issue.4, pp.937-951, 2004.

I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong, Freenet : A distributed anonymous information storage and retrieval system, Proceedings of Designing Privacy Enhancing Technologies : Workshop on Design Issues in Anonymity and Unobservability, pp.46-66, 2000.

P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel, Could any graph be turned into a small world ? Theoretical Computer Science, 2005.

P. Fraigniaud, Greedy routing in tree-decomposed graphs : a new perspective on the small-world phenomenon, Proceedings of the 13th Annual European Symposium on Algorithms (ESA), 2005.

P. Fraigniaud and P. Gauron, Brief announcement : an overview of the content-addressable network d2b, Proceedings of the ACM 22st Symposium on Principles of Distributed Computing (PODC), p.151, 2003.

C. Gavoille, D. Peleg, S. Pérennes, and R. Raz, Distance labeling in graphs, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (SODA), pp.210-219, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00307381

C. Gavoille and D. Peleg, Compact and localized distributed data structures, Journal of Distributed Computing, vol.16, pp.111-120, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00307386

K. Horowitz and D. Malkhi, Estimating network size from local information, Inf. Process. Lett, vol.88, issue.5, pp.237-243, 2003.

D. R. Karger and M. Ruhl, Finding nearest-neighbors in growth-restricted metrics, Proceedings of the 34th annual ACM symposium on Theory of computing (STOC), pp.741-750, 2002.

J. Kleinberg, The Small-World Phenomenon : An Algorithmic Perspective, Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), pp.163-170, 2000.

J. Kleinberg, Small-world phenomena and the dynamics of information, Advances in Neural Information Processing Systems (NIPS), p.14, 2002.

D. Liben-nowell, J. Novak, R. Kumar, R. Raghavan, and A. Tomkins, Geographic routing in social networks, Proceedings of the National Academy of Science of the USA, vol.102, issue.33, pp.11623-11628, 2005.

D. Malkhi, M. Naor, and D. Ratajczak, Viceroy : a scalable and dynamic emulation of the butterfly, Proceedings of the ACM 21st Symposium on Principles of Distributed Computing (PODC), pp.183-192, 2002.

S. Milgram, The small world problem, Psychology Today, issue.1, p.61, 1967.

A. Rowstron and P. Druschel, Pastry : Scalable, distributed object location and routing for largescale peer-to-peer systems, In IFIP/ACM Int. Conf. on Distr. Syst. Platf, pp.329-350, 2001.

A. Slivkins, Distance estimation and object location via rings of neighbors, Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), 2005.

I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan, Chord : A scalable peer-to-peer lookup service for internet applications, SIGCOMM, pp.149-160, 2001.

M. Thorup and U. Zwick, Approximate distance oracles, J. ACM, vol.52, issue.1, pp.1-24, 2005.