Looking up data in P2P systems
Top Cited Papers
- 1 February 2003
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 46 (2), 43-48
- https://doi.org/10.1145/606272.606299
Abstract
The main challenge in P2P computing is to design and implement a robust and scalable distributed system composed of inexpensive, individually unreliable computers in unrelated administrative domains. The participants in a typical P2P system might include computers at homes, schools, and businesses, and can grow to several million concurrent participants.Keywords
This publication has 7 references indexed in Scilit:
- Distributed object location in a dynamic networkPublished by Association for Computing Machinery (ACM) ,2002
- Analysis of the evolution of peer-to-peer systemsPublished by Association for Computing Machinery (ACM) ,2002
- ViceroyPublished by Association for Computing Machinery (ACM) ,2002
- Finding nearest neighbors in growth-restricted metricsPublished by Association for Computing Machinery (ACM) ,2002
- A scalable content-addressable networkPublished by Association for Computing Machinery (ACM) ,2001
- ChordPublished by Association for Computing Machinery (ACM) ,2001
- Accessing nearby copies of replicated objects in a distributed environmentPublished by Association for Computing Machinery (ACM) ,1997