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
Quantile and histogram estimation
Proceedings of the 33nd conference on Winter simulation
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
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Performance and Dependability of Structured Peer-to-Peer Overlays
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
An adaptive stabilization framework for distributed hash tables
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A statistical theory of chord under churn
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Modelling energy efficiency in distributed home environments
International Journal of Communication Networks and Distributed Systems
ChurnDetect: a gossip-based churn estimator for large-scale dynamic networks
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
A Bayesian approach for user aware peer-to-peer video streaming systems
Image Communication
| Hi-index | 0.00 |
In structured peer-to-peer (P2P) networks participating peers can join or leave the system at arbitrary times, a process which is known as churn. Many recent studies revealed that churn is one of the main problems faced by any Distributed Hash Table (DHT). In this paper we discuss different possibilities of how to estimate the current churn rate in the system. In particular, we show how to obtain a robust estimate which is independent of the implementation details of the DHT. We also investigate the trade-offs between accuracy, overhead, and responsiveness to changes.