Analysis of the evolution of peer-to-peer systems
Top Cited Papers
- 21 July 2002
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 233-242
- https://doi.org/10.1145/571825.571863
Abstract
In this paper, we give a theoretical analysis of peer-to-peer (P2P) networks operating in the face of concurrent joins and unexpected departures. We focus on Chord, a recently developed P2P system that implements a distributed hash table abstraction, and study the process by which Chord maintains its distributed state as nodes join and leave the system. We argue that traditional performance measures based on run-time are uninformative for a continually running P2P network, and that the rate at which nodes in the network need to participate to maintain system state is a more useful metric. We give a general lower bound on this rate for a network to remain connected, and prove that an appropriately modified version of Chord's maintenance rate is within a logarithmic factor of the optimum rate.Keywords
This publication has 7 references indexed in Scilit:
- PAST: a large-scale, persistent peer-to-peer storage utilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Wide-area cooperative storage with CFSPublished by Association for Computing Machinery (ACM) ,2001
- A scalable content-addressable networkPublished by Association for Computing Machinery (ACM) ,2001
- ChordPublished by Association for Computing Machinery (ACM) ,2001
- OceanStorePublished by Association for Computing Machinery (ACM) ,2000
- Consistent hashing and random treesPublished by Association for Computing Machinery (ACM) ,1997
- Accessing nearby copies of replicated objects in a distributed environmentPublished by Association for Computing Machinery (ACM) ,1997