Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Network Resilience: A Measure of Network Fault Tolerance
IEEE Transactions on Computers
The complexity of the residual node connectedness reliability problem
SIAM Journal on Computing
Adventures in stochastic processes
Adventures in stochastic processes
The changing nature of network traffic: scaling phenomena
ACM SIGCOMM Computer Communication Review
Unicast in Hypercubes with Large Number of Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
On k-connectivity for a geometric random graph
Random Structures & Algorithms
Matrix analysis and applied linear algebra
Matrix analysis and applied linear algebra
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
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
Combinatorial Analysis of the Fault-Diameter of the N-Cube
IEEE Transactions on Computers
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Hypercube Network Fault Tolerance: A Probabilistic Approach
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
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
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On zone-balancing of peer-to-peer networks: analysis of random node join
Proceedings of the joint international conference on Measurement and modeling of computer systems
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On Static and Dynamic Partitioning Behavior of Large-Scale Networks
ICNP '05 Proceedings of the 13TH 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
Impact of neighbor selection on performance and resilience of structured p2p networks
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
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
In-degree dynamics of large-scale P2P systems
ACM SIGMETRICS Performance Evaluation Review
A Bayesian approach for user aware peer-to-peer video streaming systems
Image Communication
P2P group management systems: A conceptual analysis
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affect the resilience of such graphs. We start by applying classical results from random graph theory to show that a large variety of deterministic and random P2P graphs almost surely (i.e., with probability 1-O(1)) remain connected under random failure if and only if they have no isolated nodes. This simple, yet powerful, result subsequently allows us to derive in closed-form the probability that a P2P network develops isolated nodes, and therefore partitions, under both types of node failure. We finish the paper by demonstrating that our models match simulations very well and that dynamic P2P systems are extremely resilient under node churn as long as the neighbor replacement delay is much smaller than the average user lifetime.