Adventures in stochastic processes
Adventures in stochastic processes
On the self-similar nature of Ethernet traffic
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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
Incentives for sharing in peer-to-peer networks
Proceedings of the 3rd ACM conference on Electronic Commerce
Censorship resistant peer-to-peer content addressable networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fault-tolerant routing in peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Dynamically Fault-Tolerant Content Addressable Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
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
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 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
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
On the fault tolerance of some popular bounded-degree networks
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
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
On Gnutella topology dynamics by studying leaf and ultra connection jointly in phase space
Computer Networks: The International Journal of Computer and Telecommunications Networking
A QoS-aware VoD resource sharing scheme for heterogeneous networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the reliability of large-scale distributed systems - A topological view
Computer Networks: The International Journal of Computer and Telecommunications Networking
An intelligent infotainment dissemination scheme for heterogeneous vehicular networks
Expert Systems with Applications: An International Journal
Exploring the feasibility of reputation systems under churn
IEEE Communications Letters
Stability and performance of overlay multicast systems employing forward error correction
Performance Evaluation
Joining a Distributed Shared Memory Computation in a Dynamic Distributed System
SEUS '09 Proceedings of the 7th IFIP WG 10.2 International Workshop on Software Technologies for Embedded and Ubiquitous Systems
An experimental study of peer behavior in a pure P2P network
Journal of Systems and Software
Uniformity of improved versions of chord
ICICA'10 Proceedings of the First international conference on Information computing and applications
Peer rewiring in semantic overlay networks under churn
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
Dynamic regular registers in systems with churn
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Regular register: an implementation in a churn prone environment
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Improving data availability in chord p2p system
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Resilience and reliability analysis of P2P network systems
Operations Research Letters
Enhancing Routing Robustness of Unstructured Peer-to-Peer Networks Using Mobile Agents
Journal of Network and Systems Management
Fault tolerant decentralised K-Means clustering for asynchronous large-scale networks
Journal of Parallel and Distributed Computing
P2P group management systems: A conceptual analysis
ACM Computing Surveys (CSUR)
The Journal of Supercomputing
Dynamic regular registers in systems with churn
Theoretical Computer Science
| Hi-index | 0.00 |
To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to lifetime-based node failure and derives the expected delay before a user is forcefully isolated from the graph and the probability that this occurs within his/her lifetime. Using these metrics, we show that systems with heavy-tailed lifetime distributions are more resilient than those with light-tailed (e.g., exponential) distributions and that for a given average degree, k-regular graphs exhibit the highest level of fault tolerance. As a practical illustration of our results, each user in a system with n = 100 billion peers, 30-minute average lifetime, and 1-minute node-replacement delay can stay connected to the graph with probability 1 - 1/n using only 9 neighbors. This is in contrast to 37 neighbors required under previous modeling efforts. We finish the paper by observing that many P2P networks are almost surely (i.e., with probability 1 -- o(1)) connected if they have no isolated nodes and derive a simple model for the probability that a P2P system partitions under churn.