A survey and comparison of peer-to-peer overlay network schemes
Top Cited Papers
- 1 January 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Surveys & Tutorials
- Vol. 7 (2) , 72-93
- https://doi.org/10.1109/comst.2005.1610546
Abstract
Over the Internet today, computing and communications environments are significantly more complex and chaotic than classical distributed systems, lacking any centralized organization or hierarchical control. There has been much interest in emerging Peer-to-Peer (P2P) network overlays because they provide a good substrate for creating large-scale data sharing, content distribution, and application-level multicast applications. These P2P overlay networks attempt to provide a long list of features, such as: selection of nearby peers, redundant storage, efficient search/location of data items, data permanence or guarantees, hierarchical naming, trust and authentication, and anonymity. P2P networks potentially offer an efficient routing architecture that is self-organizing, massively scalable, and robust in the wide-area, combining fault tolerance, load balancing, and explicit notion of locality. In this article we present a survey and comparison of various Structured and Unstructured P2P overlay networks. We categorize the various schemes into these two groups in the design spectrum, and discuss the application-level network performance of each group.Keywords
This publication has 63 references indexed in Scilit:
- Tapestry: A Resilient Global-Scale Overlay for Service DeploymentIEEE Journal on Selected Areas in Communications, 2004
- Chord: a scalable peer-to-peer lookup protocol for internet applicationsIEEE/ACM Transactions on Networking, 2003
- Efficient topology-aware overlay networkACM SIGCOMM Computer Communication Review, 2003
- A blueprint for introducing disruptive technology into the InternetACM SIGCOMM Computer Communication Review, 2003
- Secure routing for structured peer-to-peer overlay networksACM SIGOPS Operating Systems Review, 2002
- PasticheACM SIGOPS Operating Systems Review, 2002
- Search in power-law networksPhysical Review E, 2001
- A scalable content-addressable networkACM SIGCOMM Computer Communication Review, 2001
- Maintenance-free global data storageIEEE Internet Computing, 2001
- Error and attack tolerance of complex networksNature, 2000