The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Understanding churn in peer-to-peer networks
Abstract
The dynamics of peer participation, or churn, are an inherent property of Peer-to-Peer (P2P) systems and critical for design and evaluation. Accurately characterizing churn requires precise and unbiased information about the arrival and departure of peers, which is challenging to acquire. Prior studies show that peer participation is highly dynamic but with conflicting characteristics. Therefore, churn remains poorly understood, despite its significance.In this paper, we identify several common pitfalls that lead to measurement error. We carefully address these difficulties and present a detailed study using three widely-deployed P2P systems: an unstructured file-sharing system (Gnutella), a content-distribution system (BitTorrent), and a Distributed Hash Table (Kad). Our analysis reveals several properties of churn: (i) overall dynamics are surprisingly similar across different systems, (ii) session lengths are not exponential, (iii) a large portion of active peers are highly stable while the remaining peers turn over quickly, and (iv) peer session lengths across consecutive appearances are correlated. In summary, this paper advances our understanding of churn by improving accuracy, comparing different P2P file sharingdistribution systems, and exploring new aspects of churn.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
Maymounkov, P., & Mazières, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_5 · Cited by 3,004
Self-similarity in World Wide Web traffic: evidence and possible causes
Crovella, M. E., & Bestavros, A. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650143 · Cited by 2,731
Rhea, S. C., Geels, D., Roscoe, T., & Kubiatowicz, J. D. (2004) · Cited by 875
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
Gummadi, K. P., Dunn, R. J., Saroiu, S., Gribble, S. D., Levy, H. M., & Zahorjan, J. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945475 · Cited by 818
The Bittorrent P2P File-Sharing System: Measurements and Analysis
Pouwelse, J., Garbacki, P., Epema, D., & Sips, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11558989_19 · Cited by 760
Analyzing Peer-To-Peer Traffic Across Large Networks
Sen, S., & Wang, J. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.826277 · Cited by 586
Bhagwan, R., Savage, S., & Voelker, G. M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45172-3_24 · Cited by 563
Karagiannis, T., Broido, A., Brownlee, N., Claffy, K. C., & Faloutsos, M. (2005) · IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. · doi:10.1109/glocom.2004.1378239 · Cited by 504 · cited 1×
“Difficulties in correctly identifying peer-to-peer flows [ 12 ] can also limit measurement accuracy.”
BackgroundDissecting BitTorrent: Five Months in a Torrent’s Lifetime
Izal, M., Urvoy-Keller, G., Biersack, E. W., Felber, P. A., Hamra, A. A., & Garcés-Erice, L. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24668-8_1 · Cited by 485
Measuring and analyzing the characteristics of Napster and Gnutella hosts
Saroiu, S., Gummadi, K. P., & Gribble, S. D. (2003) · Multimedia Systems · doi:10.1007/s00530-003-0088-1 · Cited by 383
Measurements, Analysis, and Modeling of BitTorrent-like Systems
Guo, L., Chen, S., Xiao, Z., Tan, E., Ding, X., & Zhang, X. (2005) · Cited by 369
Should Internet Service Providers Fear Peer-Assisted Content Distribution?
Karagiannis, T., Rodríguez, P., & Papagiannaki, K. (2005) · Cited by 334
An analysis of live streaming workloads on the internet
Sripanidkulchai, K., Maggs, B., & Zhang, H. (2004) · Proceedings of the 4th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1028788.1028795 · Cited by 317
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
Gummadi, K. P., Dunn, R. J., Saroiu, S., Gribble, S. D., Levy, H. M., & Zahorjan, J. (2003) · Proceedings of the nineteenth ACM symposium on Operating systems principles · doi:10.1145/945445.945475 · Cited by 232
A performance vs. cost framework for evaluating DHT design tradeoffs under churn
Li, J., Stribling, J., Morris, R., Kaashock, M. F., & Gil, T. A. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1497894 · Cited by 216
The FastTrack overlay: A measurement study
Liang, J., Kumar, R., & Ross, K. W. (2006) · Computer Networks · doi:10.1016/j.comnet.2005.07.014 · Cited by 158
Characterizing unstructured overlay topologies in modern P2P file-sharing systems
Stutzbach, D., Rejaie, R., & Sen, S. B. (2005) · doi:10.5555/1251086.1251091 · Cited by 98
Self-citationOn lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
Leonard, D., Rai, V., & Loguinov, D. (2005) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/1064212.1064217 · Cited by 95
Capturing accurate snapshots of the Gnutella network
Stutzbach, D., & Rejaie, R. (2006) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2006.347 · Cited by 90
Self-citation
Cited by
Can ISPS and P2P users cooperate for improved performance?
Aggarwal, V., Feldmann, A., & Scheideler, C. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1273445.1273449 · Cited by 393
A Survey of Rate Adaptation Techniques for Dynamic Adaptive Streaming Over HTTP
Kua, J., Armitage, G., & Branch, P. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2685630 · Cited by 318
iCOP: Live forensics to reveal previously unknown criminal media on P2P networks
Peersman, C., Schulze, C., Rashid, A., Brennan, M., & Fischer, C. (2016) · Digital Investigation · doi:10.1016/j.diin.2016.07.002 · Cited by 33
“…by a number of studies involving a timespan of several days (e.g. (Hughes et al., 2006, 2008)), weeks (e.g. (Latapy et al., 2013)), months (e.g. (Prichard et al., 2011; Menasche et al., 2009; Stutzbach and Rejaie, 2006; Gummadi et al., 2003)) or even an entire year ((Hurley et al., 2013)).”
Background
Metadata
- Authors
- Stutzbach, D., & Rejaie, R.
- Venue
- Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
- Publisher
- ACM
- Published
- 2006-10-25
- Pages
- 189-202
- OpenAlex
- W2148573461
- Cited by
- 751
- References
- 19
- FWCI
- 41.73
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.