Adventures in stochastic processes
Adventures in stochastic processes
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Proof of a fundamental result in self-similar traffic modeling
ACM SIGCOMM Computer Communication Review
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
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
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
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
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Failure recovery for structured P2P networks: protocol design and performance evaluation
Proceedings of the joint international conference on Measurement and modeling of computer systems
Performance and Dependability of Structured Peer-to-Peer Overlays
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Friendships that last: peer lifespan and its role in P2P protocols
Web content caching and distribution
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
Can unstructured P2P protocols survive flash crowds?
IEEE/ACM Transactions on Networking (TON)
On Static and Dynamic Partitioning Behavior of Large-Scale Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Learning from labeled and unlabeled data on a directed graph
ICML '05 Proceedings of the 22nd international conference on Machine learning
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Large Scaling Unstructured Peer-to-Peer Networks with Heterogeneity-Aware Topology and Routing
IEEE Transactions on Parallel and Distributed Systems
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Bandwidth-efficient management of DHT routing tables
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
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
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
Comparing the performance of distributed hash tables under churn
IPTPS'04 Proceedings of the Third 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
Minimizing node churn in peer-to-peer streaming
Computer Communications
P2P group management systems: A conceptual analysis
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Previous analytical studies of unstructured P2P resilience have assumed exponential user lifetimes and only con-sidered age-independent neighbor replacement. In this paper, we overcome these limitations by introducing a general node-isolation model for heavy-tailed user lifetimes and arbitrary neighbor-se-lection algorithms. Using this model, we analyze two age-biased neighbor-selection strategies and show that they significantly improve the residual lifetimes of chosen users, which dramatically reduces the probability of user isolation and graph partitioning compared with uniform selection of neighbors. In fact, the second strategy based on random walks on age-proportional graphs demonstrates that, for lifetimes with infinite variance, the system monotonically increases its resilience as its age and size grow. Specifically, we show that the probability of isolation converges to zero as these two metrics tend to infinity. We finish the paper with simulations in finite-size graphs that demonstrate the effect of this result in practice.