J. Aspnes and G. Shah, Skip graphs, Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.384-393, 2003.
DOI : 10.1145/1290672.1290674

S. Basu, S. Banerjee, P. Sharma, and S. Lee, NodeWiz: Peer-to-Peer Resource Discovery for Grids, 5th International Workshop on Global and Peer-to-Peer Computing (GP2PC), 2005.

A. Bharambe, M. Agrawal, and S. Seshan, Mercury: Supporting Scalable MultiAttribute Range Queries, Proceedings of the SIGCOMM Symposium, 2004.

J. W. Byers, J. Considine, and M. Mitzenmacher, Simple Load Balancing for Distributed Hash Tables, IPTPS, pp.80-87, 2003.

E. Caron, F. Desprez, and C. Tedeschi, A Dynamic Prefix Tree for the Service Discovery Within Large Scale Grids, The Sixth IEEE International Conference on Peer-to-Peer Computing, vol.2, pp.106-113, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01429999

P. Chan and D. Abramson, A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids, 3rd IEEE International Conference on e-Science and Grid Computing, pp.10-13, 2007.

A. Datta, M. Hauswirth, R. John, R. Schmidt, and K. Aberer, Range queries in trie-structured overlays, The Fifth IEEE International Conference on Peer-to-Peer Computing, 2005.
DOI : 10.1109/p2p.2005.31

B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, Load balancing in dynamic structured P2P systems, Proc. IEEE INFOCOM, 2004.

A. Iamnitchi and I. Foster, On Death, Taxes, and the Convergence of Peer-toPeer and Grid Computing, IPTPS, pp.118-128, 2003.

D. R. Karger and M. Ruhl, Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems, IPTPS, pp.131-140, 2004.
DOI : 10.1145/1007912.1007919

J. Ledlie and M. I. Seltzer, Distributed, Secure Load Balancing with Skew, Heterogeneity and Churn, INFOCOM, pp.1419-1430, 2005.
DOI : 10.1109/infcom.2005.1498366
URL : https://dash.harvard.edu/bitstream/1/2962660/2/Seltzer_DistributedSecure.pdf

M. Cai, M. Frank, J. Chen, and P. Szekely, MAAN: A multi-attribute addressable network for Grid information services, vol.2, pp.3-14, 2004.
DOI : 10.1007/s10723-004-1184-y

D. Oppenheimer, J. Albrecht, D. Patterson, and A. Vahdat, Distributed Resource Discovery on PlanetLab with SWORD, Proceedings of the ACM/USENIX Workshop on Real, Large Distributed Systems (WORLDS), 2004.

S. Ramabhadran, S. Ratnasamy, J. M. Hellerstein, and S. Shenker, Prefix hash tree an indexing data structure over distributed hash tables, Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, 2004.

A. Rowstron and P. Druschel, Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-To-Peer Systems, International Conference on Distributed Systems Platforms (Middleware), 2001.

C. Schmidt and M. Parashar, Enabling Flexible Queries with Guarantees in P2P Systems, IEEE Internet Computing, vol.8, issue.3, pp.19-26, 2004.

Y. Shu, B. C. Ooi, K. Tan, and A. Zhou, Supporting Multi-Dimensional Range Queries in Peer-to-Peer Systems, Peer-to-Peer Computing, 2005.

I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, Chord: A Scalable Peer-to-Peer Lookup service for Internet Applications, ACM SIGCOMM, pp.149-160, 2001.

B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph et al., Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment, IEEE Journal on Selected Areas in Communications, vol.22, issue.1, pp.41-53, 2004.

, Unité de recherche INRIA Rhône-Alpes 655, avenue de l'Europe -38334 Montbonnot

. Unité-de-recherche-inria-futurs, Parc Club Orsay Université -ZAC des Vignes 4, rue Jacques Monod -91893 ORSAY Cedex

. Unité-de-recherche-inria-lorraine, LORIA, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602