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
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 the fault tolerance of some popular bounded-degree networks
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Building low-diameter peer-to-peer networks
IEEE Journal on Selected Areas in Communications
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
On unbiased sampling for unstructured peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Improving the Fault Resilience of Overlay Multicast for Media Streaming
IEEE Transactions on Parallel and Distributed Systems
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Stochastic analysis of the interplay between object maintenance and churn
Computer Communications
Improving stability for peer-to-peer multicast overlays by active measurements
Journal of Systems Architecture: the EUROMICRO Journal
Resilience of structured P2P systems under churn: The reachable component method
Computer Communications
Designing less-structured P2P systems for the expected high churn
IEEE/ACM Transactions on Networking (TON)
Resilient and efficient load balancing in distributed hash tables
Journal of Network and Computer Applications
Node isolation model and age-based neighbor selection in unstructured P2P networks
IEEE/ACM Transactions on Networking (TON)
On unbiased sampling for unstructured peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Residual-based estimation of peer and link lifetimes in P2P networks
IEEE/ACM Transactions on Networking (TON)
Exploring the Feasibility of Reputation Models for Improving P2P Routing under Churn
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Efficient tree management for resilient overlay multicast
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
On disconnection node failure and stochastic static resilience of P2P communication networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Analyzing the aggregate download bandwidths in peer-to-peer live streaming systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Performance impacts of node failures on a chord-based hierarchical peer-to-peer network
EUNICE'10 Proceedings of the 16th EUNICE/IFIP WG 6.6 conference on Networked services and applications: engineering, control and management
Performance comparison of erasure codes for different churn models in P2P storage systems
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
Value-based sequential consistency for set objects in dynamic distributed systems
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Reliability and relay selection in peer-to-peer communication systems
Principles, Systems and Applications of IP Telecommunications
Impact of dynamics on situated and global aggregation schemes
AIMS'11 Proceedings of the 5th international conference on Autonomous infrastructure, management, and security: managing the dynamics of networks and services
Evaluation of p2p systems under different churn models: why we should bother
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Providing hierarchical lookup service for P2P-VoD systems
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special Issue on P2P Streaming
P2P consistency support for large-scale interactive applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Still Alive: Extending Keep-Alive Intervals in P2P Overlay Networks
Mobile Networks and Applications
Sophia: A local trust system to secure key-based routing in non-deterministic DHTs
Journal of Parallel and Distributed Computing
Understanding the effects of P2P dynamics on trust bootstrapping
Information Sciences: an International Journal
Resilience of dynamic overlays through local interactions
Proceedings of the 22nd international conference on World Wide Web companion
| Hi-index | 0.00 |
To understand how high rates of churn and random departure decisions of end-users affect connectivity of P2P networks, this paper investigates 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. Our results indicate 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 resilience. 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 showing 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.