A. Brampton, A. MacQuire, I. A. Rai, N. J. P. Race, and L. Mathy. Stealth Distributed Hash Table: A robust and flexible super-peered DHT. In Proc. of the 2nd Conference on Future Networking Technologies (CoNEXT), Lisbon, Portugal, December 2006.
K. L. Calvert, M. B. Doar, and E. W. Zegura. Modeling Internet topology. IEEE Communications Magazine, 35(6): 160-163, June 1997.
M. F. Kaashoek and D. R. Karger. Koorde: A simple degree-optimal distributed hash table. In Proc. of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), 2003.
A. Leon-Garcia. Probability and Random Processes for Electrical Engineering. Addison-Wesley, second edition, 1994.
S. Ratnasamy, R Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proc. of ACM SIGCOMM, August 2001.
A. Rowstron and R Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, November 2001.
A. Spognardi and R. D. Pietro. A formal framework for the performance analysis of P2P networks protocols. In Proc. of the 3rd International Workshop on Hot Topics in Peer-toPeer Systems (Hot-P2P), Rhodes Island, Greece, April 2006.
A. Spognardi, R. D. Pietro, and L. V. Mancini. BaRT, balanced randomized tree: A scalable and distributed protocol for lookup in peer-to-peer networks. In Proc. of the 1st International Workshop on Hot Topics in Peer-to-Peer Systems (Hot-P2P'04), 2004.
I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. of ACM SIGCOMM, pages 149-160, August 2001.
B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22(1):41-53, 2004.
