Resilience of structured P2P systems under churn: The reachable component method

Authors:
Joseph S. Kong;Jesse S. A. Bridgewater;Vwani P. Roychowdhury
Affiliations:
Electrical Engineering Department, University of California, Los Angeles, CA 90095, USA;Electrical Engineering Department, University of California, Los Angeles, CA 90095, USA;Electrical Engineering Department, University of California, Los Angeles, CA 90095, USA
Venue:
Computer Communications
Year:
2008

Citing 24
Cited 3

Accessing nearby copies of replicated objects in a distributed environment

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
The small-world phenomenon: an algorithmic perspective

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Analysis of the evolution of peer-to-peer systems

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Incrementally improving lookup latency in distributed hash table systems

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The impact of DHT routing geometry on resilience and proximity

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Analyzing peer-to-peer traffic across large networks

IEEE/ACM Transactions on Networking (TON)
Failure recovery for structured P2P networks: protocol design and performance evaluation

Proceedings of the joint international conference on Measurement and modeling of computer systems
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks

SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Routing complexity of faulty networks

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Degree-Optimal Deterministic Routing for P2P Systems

ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
On Static and Dynamic Partitioning Behavior of Large-Scale Networks

ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
D2B: a de Bruijn based content-addressable network

Theoretical Computer Science - Complex networks
Minimizing churn in distributed systems

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Understanding churn in peer-to-peer networks

Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Handling churn in a DHT

ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Symphony: distributed hashing in a small world

USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks

ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
A statistical theory of chord under churn

IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Building low-diameter peer-to-peer networks

IEEE Journal on Selected Areas in Communications

Enhancing Routing Robustness of Unstructured Peer-to-Peer Networks Using Mobile Agents

Journal of Network and Systems Management
CPSCox: A survival analysis model of peer behavior in large scale DHT system

Computer Communications
Resilience of dynamic overlays through local interactions

Proceedings of the 22nd international conference on World Wide Web companion

Quantified Score

Hi-index	0.24

Visualization

Abstract

Users in a peer-to-peer (P2P) system join and leave the network in a continuous manner. Understanding the resilience properties of P2P systems under high rate of node churn becomes important. In this work, we first find that a lifetime-based dynamic churn model for a P2P network that has reached stationarity is reducible to a uniform node failure model. This is a simple yet powerful result that bridges the gap between the complex dynamic churn models and the more tractable uniform failure model. We further develop the reachable component method and derive the routing performance of a wide-range of structured P2P systems under varying rates of churn. We find that the de Bruijn graph based routing systems offer excellent resilience under extremely high rate of node turnovers, followed by a group of routing systems that include CAN, Kademlia, Chord and randomized-Chord. We show that our theoretical predictions agree well with large-scale simulation results. We finish by suggesting methods to further improve the routing performance of dynamic P2P systems in the presence of churn and failures.