1. [1] A. Rowstron and P. Druschel, “Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems,” Middleware 2001, Lecture Notes in Computer Science, vol.2218, pp.329-350, Springer, 2001.
2. [2] A.R. Bharambe, M. Agrawal, and S. Seshan, “Mercury: Supporting scalable multi-attribute range queries,” SIGCOMM Comput. Commun. Rev., vol.34, no.4, pp.353-366, 2004.
3. [3] G.S. Manku, M. Bawa, and P. Raghavan, “Symphony: Distributed hashing in a small world,” Proc. USENIX Symposium on Internet Technologies and Systems, USITS, pp.127-140, USENIX Association, Berkeley, CA, USA, 2003.
4. [4] B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph, and J.D. Kubiatowicz, “Tapestry: A resilient global-scale overlay for service deployment,” IEEE J. Sel. Areas. Commun., vol.22, no.1, pp.41-53, 2004.
5. [5] M. Castro, M. Costa, and A. Rowstron, “Debunking some myths about structured and unstructured overlays,” Proc. 2nd Conference on Symposium on Networked Systems Design & Implementation, vol.2, pp.85-98, 2005