Article

Understanding churn in peer-to-peer networks

Authors:

Daniel Stutzbach,

Reza RejaieAuthors Info & Claims

IMC '06: Proceedings of the 6th ACM SIGCOMM conference on Internet measurement

Pages 189 - 202

https://doi.org/10.1145/1177080.1177105

Published: 25 October 2006 Publication History

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.

References

[1]

eMule. http://www.emule-project.net, 2005.

[2]

slyck.com. http://www.slyck.com, 2005.

[3]

R. Bhagwan, S. Savage, and G. Voelker. Understanding Availability. In International Workshop on Peer-to-Peer Systems, 2003.

[4]

A. Bharambe and C. Herley. Analyzing and Improving BitTorrent Performance. Technical Report MSR-TR-2005-03, Microsoft Research, 2005.

[5]

F. E. Bustamante and Y. Qiao. Friendships that last: Peer lifespan and its role in P2P protocols. In International Workshop on Web Content Caching and Distribution, 2003.

[6]

J. Chu, K. Labonte, and B. N. Levine. Availability and Locality Measurements of Peer-to-Peer File Systems. In ITCom: Scalability and Traffic Control in IP Networks II Conferences, 2002.

[7]

M. E. Crovella and A. Bestavros. Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes. Transactions on Networking, 5(6), 1997.

Digital Library

[8]

Free Peers, Inc. BearShare Network Statistics. http://www.bearshare.com/stats/, 2005.

[9]

K. P. Gummadi, R. J. Dunn, S. Saroiu, S. D. Gribble, H. M. Levy, and J. Zahorjan. Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload. In SOSP, 2003.

Digital Library

[10]

L. Guo, S. Chen, Z. Xiao, E. Tan, X. Ding, and X. Zhang. Measurements, Analysis, and Modeling of BitTorrent-like Systems. In Internet Measurement Conference, 2005.

Digital Library

[11]

M. Izal, G. Urvoy-Keller, E. W. Biersack, P. A. Felber, A. A. Hamra, and L. Garces-Erice. Dissecting BitTorrent: Five Months in a Torrent's Lifetime. In PAM, 2004.

[12]

T. Karagiannis, A. Broido, N. Brownlee, K. Claffy, and M. Faloutsos. Is P2P dying or just hiding? In Globecom, 2004.

[13]

T. Karagiannis, P. Rodriguez, and K. Papagiannaki. Should Internet Service Providers Fear Peer-Assisted Content Distribution? In Internet Measurement Conference, 2005.

Digital Library

[14]

D. Leonard, V. Rai, and D. Loguinov. On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks. In SIGMETRICS, 2005.

Digital Library

[15]

J. Li, J. Stribling, F. Kaashoek, R. Morris, and T. Gil. A Performance vs. Cost Framework for Evaluating DHT Design Tradeoffs under Churn. In INFOCOM, 2005.

[16]

J. Li, J. Stribling, R. Morris, and M. F. Kaashoek. Bandwidth-efficient Management of DHT Routing Tables. In Networked Systems Design and Implementation, 2005.

Digital Library

[17]

J. Liang, R. Kumar, and K. W. Ross. The KaZaA Overlay: A Measurement Study. Computer Networks Journal (Elsevier), 2005.

Digital Library

[18]

D. Liben-Nowell, H. Balakrishnan, and D. Karger. Analysis of the Evolution of Peer-to-Peer Systems. In Principles of Distributed Computing, 2002.

Digital Library

[19]

Lime Wire LLC. Crawler Compatability. Gnutella Developer's Forum, 2003.

[20]

P. Maymounkov and D. Mazieres. Kademlia: A Peer-to-peer Information System Based on the XOR Metric. In International Workshop on Peer-to-Peer Systems, 2002.

Digital Library

[21]

J. Pouwelse, P. Garbacki, D. Epema, and H. Sips. The Bittorrent P2P File-sharing System: Measurements and Analysis. In International Workshop on Peer-to-Peer Systems (IPTPS), 2005.

Digital Library

[22]

S. Rhea, D. Geels, and J. Kubiatowicz. Handling Churn in a DHT. In USENIX, 2004.

Digital Library

[23]

S. Saroiu, P. K. Gummadi, and S. D. Gribble. Measuring and Analyzing the Characteristics of Napster and Gnutella Hosts. Multimedia Systems Journal, 9(2), 2003.

Digital Library

[24]

S. Sen and J. Wang. Analyzing Peer-To-Peer Traffic Across Large Networks. IEEEACM Transactions on Networking, 12(2), 2004.

Digital Library

[25]

K. Sripanidkulchai, B. Maggs, and H. Zhang. An Analysis of Live Streaming Workloads on the Internet. In Internet Measurement Conference, 2004.

Digital Library

[26]

D. Stutzbach and R. Rejaie. Capturing Accurate Snapshots of the Gnutella Network. In Global Internet Symposium, 2005.

[27]

D. Stutzbach, R. Rejaie, and S. Sen. Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems. In Internet Measurement Conference, 2005.

Digital Library

Cited By

Lajam OMohammed S(2024)Optimizing efficiency of P2P content distribution with network codingJournal of Network and Computer Applications10.1016/j.jnca.2024.103825223:COnline publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1016/j.jnca.2024.103825
Shilina S(2023)The Promise of Blockchain-Based Decentralized Social NetworksConcepts, Technologies, Challenges, and the Future of Web 310.4018/978-1-6684-9919-1.ch010(172-197)Online publication date: 20-Oct-2023
https://doi.org/10.4018/978-1-6684-9919-1.ch010
Wu FYuen HChan HLeung VCai W(2023)Facilitating Serverless Match-based Online Games with Novel Blockchain TechnologiesACM Transactions on Internet Technology10.1145/356588423:1(1-26)Online publication date: 23-Feb-2023
https://dl.acm.org/doi/10.1145/3565884
Show More Cited By

Index Terms

Understanding churn in peer-to-peer networks

Recommendations

Performance analysis of structured peer-to-peer overlays for mobile networks

Distributed Hash Table DHT based Peer-to-Peer P2P overlays have been widely researched and deployed in many applications such as file sharing, IP telephony, content distribution and media streaming applications. However, their deployment has largely ...
Churn: A Key Effect on Real-World P2P Software
ICPP '13: Proceedings of the 2013 42nd International Conference on Parallel Processing

Churn refers to a large number of arriving and departing participants within a short time in peer-to-peer (P2P) networks. This paper studies the impact of churn on real-world unstructured P2P networks. To this end, we need collecting snapshots of P2P ...
Resolving the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks

Prior studies show that more than 70 percent of communication paths in a popular unstructured peer-to-peer (P2P) system (i.e., Gnutella) do not exploit the physical network topology, leading to the topology mismatch problem, and thus, lengthen ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

IMC '06: Proceedings of the 6th ACM SIGCOMM conference on Internet measurement

October 2006

356 pages

ISBN:1595935614

DOI:10.1145/1177080

General Chairs:
Jussara Almeida
Federal University of Minas Gerais, Brazil
,
Virgilio Almeida
Federal University of Minas Gerais, Brazil
,
Program Chair:
Paul Barford
University of Wisconsin -- Madison, USA

Copyright � 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 October 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

IMC06

Sponsor:

IMC06: Internet Measurement Conference

October 25 - 27, 2006

Rio de Janeriro, Brazil

Acceptance Rates

Overall Acceptance Rate 277 of 1,083 submissions, 26%

Upcoming Conference

IMC '24

Sponsor:
sigcomm
sigcomm

ACM Internet Measurement Conference

November 4 - 6, 2024

Madrid , AA , Spain

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

527
Total Citations
View Citations
3,211
Total Downloads

Downloads (Last 12 months)98
Downloads (Last 6 weeks)12

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lajam OMohammed S(2024)Optimizing efficiency of P2P content distribution with network codingJournal of Network and Computer Applications10.1016/j.jnca.2024.103825223:COnline publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1016/j.jnca.2024.103825
Shilina S(2023)The Promise of Blockchain-Based Decentralized Social NetworksConcepts, Technologies, Challenges, and the Future of Web 310.4018/978-1-6684-9919-1.ch010(172-197)Online publication date: 20-Oct-2023
https://doi.org/10.4018/978-1-6684-9919-1.ch010
Wu FYuen HChan HLeung VCai W(2023)Facilitating Serverless Match-based Online Games with Novel Blockchain TechnologiesACM Transactions on Internet Technology10.1145/356588423:1(1-26)Online publication date: 23-Feb-2023
https://dl.acm.org/doi/10.1145/3565884
Kim RSong HPark G(2023)Moving Real-Time Services to Web 3.0: Challenges and OpportunitiesIEEE Transactions on Services Computing10.1109/TSC.2023.330715316:6(4041-4059)Online publication date: Nov-2023
https://doi.org/10.1109/TSC.2023.3307153
Wang JGupta I(2023)Churn-Tolerant Leader Election Protocols2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS57875.2023.00032(96-107)Online publication date: Jul-2023
https://doi.org/10.1109/ICDCS57875.2023.00032
Gupta DSaia JYoung M(2023)Bankrupting Sybil despite churnJournal of Computer and System Sciences10.1016/j.jcss.2023.02.004135:C(89-124)Online publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1016/j.jcss.2023.02.004
Kwon TSong JJung HChun SLee HKang MPark MCho E(2023)How to decentralize the internetComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2023.109911234:COnline publication date: 1-Oct-2023
https://dl.acm.org/doi/10.1016/j.comnet.2023.109911
Ando MChrist MLysyanskaya AMalkin T(2023)Poly Onions: Achieving Anonymity in the Presence of ChurnTheory of Cryptography10.1007/978-3-031-22365-5_25(715-746)Online publication date: 1-Jan-2023
https://doi.org/10.1007/978-3-031-22365-5_25
Kuriakose NMidhunchakkaravarthy D(2022)A Review on IoT Blockchain TechnologyIndian Journal of Data Communication and Networking10.54105/ijdcn.F3719.1231223:1(1-5)Online publication date: 30-Dec-2022
https://doi.org/10.54105/ijdcn.F3719.123122
Sun WXu ZChen L(2022)Fairness MattersProceedings of the VLDB Endowment10.14778/3565838.356585615:13(4048-4061)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.14778/3565838.3565856
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents