\begin{thebibliography}{10}

\bibitem{overlay}
David~G. Andersen, Hari Balakrishnan, M.~Frans Kaashoek, and Robert Morris.
\newblock Resilient overlay networks.
\newblock In {\em Symposium on Operating Systems Principles}, pages 131--145,
  2001.

\bibitem{zipflike}
Lee Breslau, Pei Cao, Li~Fan, Graham Phillips, and Scott Shenker.
\newblock Web caching and zipf-like distributions: Evidence and implications.
\newblock In {\em {INFOCOM} (1)}, pages 126--134, 1999.

\bibitem{exploitNetworkp2p}
M.~Castro, P.~Druschel, Y.~Hu, and A.~Rowstron.
\newblock Exploiting network proximity in distributed hash tables, 2002.

\bibitem{cfs}
Frank Dabek, M.~Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica.
\newblock Wide-area cooperative storage with {CFS}.
\newblock In {\em Symposium on Operating Systems Principles}, pages 202--215,
  2001.

\bibitem{gnutella}
Gnutella.

\bibitem{kazaa}
Kazaa.

\bibitem{oceanstore}
John Kubiatowicz, David Bindel, Yan Chen, Patrick Eaton, Dennis Geels,
  Ramakrishna Gummadi, Sean Rhea, Hakim Weatherspoon, Westly Weimer,
  Christopher Wells, and Ben Zhao.
\newblock Oceanstore: An architecture for global-scale persistent storage.
\newblock In {\em Proceedings of ACM ASPLOS}. ACM, November 2000.

\bibitem{brite2}
Alberto Medina, Anukool Lakhina, Ibrahim Matta, and John Byers.
\newblock {BRITE}: Universal topology generation from a user's perspective.
\newblock Technical Report 2001-003, 1 2001.

\bibitem{brite1}
Alberto Medina, Ibrahim Matta, and John Byers.
\newblock On the origin of power laws in internet topologies.
\newblock Technical Report 2000-004, 20, 2000.

\bibitem{goodtopological}
Gopal Pandurangan, Prabhakar Raghavan, and Eli Upfal.
\newblock Building p2p networks with good topological properties.

\bibitem{lowdiameter}
Gopal Pandurangan, Prabhakar Raghavan, and Eli Upfal.
\newblock Building low-diameter p2p networks.
\newblock In {\em {IEEE} Symposium on Foundations of Computer Science}, pages
  492--499, 2001.

\bibitem{plaxton}
C.~Greg Plaxton, Rajmohan Rajaraman, and Andrea~W. Richa.
\newblock Accessing nearby copies of replicated objects in a distributed
  environment.
\newblock In {\em {ACM} Symposium on Parallel Algorithms and Architectures},
  pages 311--320, 1997.

\bibitem{iris}
Project iris.

\bibitem{CAN}
Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker.
\newblock A scalable content addressable network.
\newblock Technical Report TR-00-010, Berkeley, CA, 2000.

\bibitem{openquestions}
Sylvia Ratnasamy, Scott Shenker, and Ion Stoica.
\newblock Routing algorithms for dhts: Some open questions.
\newblock 2002.

\bibitem{pastry}
Antony Rowstron and Peter Druschel.
\newblock Pastry: Scalable, decentralized object location, and routing for
  large-scale peer-to-peer systems.
\newblock {\em Lecture Notes in Computer Science}, 2218:329--??, 2001.

\bibitem{contentlocation}
K.~Sripanidkulchai, B.~Maggs, and H.~Zhang.
\newblock Efficient content location using interest-based locality in
  peer-topeer systems, 2003.

\bibitem{chord}
Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan.
\newblock Chord: {A} scalable {Peer-To-Peer} lookup service for internet
  applications.
\newblock pages 149--160.

\bibitem{tapestry}
B.~Y. Zhao, J.~D. Kubiatowicz, and A.~D. Joseph.
\newblock Tapestry: An infrastructure for fault-tolerant wide-area location and
  routing.
\newblock Technical Report UCB/CSD-01-1141, UC Berkeley, April 2001.

\end{thebibliography}