ACM Home Page
Please provide us with feedback. Feedback
Understanding churn in peer-to-peer networks
Full text PdfPdf (382 KB)
Source Internet Measurement Conference archive
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement table of contents
Rio de Janeriro, Brazil
SESSION: Peer to peer table of contents
Pages: 189 - 202  
Year of Publication: 2006
ISBN:1-59593-561-4
Authors
Daniel Stutzbach  University of Oregon
Reza Rejaie  University of Oregon
Sponsors
SIGCOMM: ACM Special Interest Group on Data Communication
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 27,   Downloads (12 Months): 318,   Citation Count: 25
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1177080.1177105
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked 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
 
8
Free Peers, Inc. BearShare Network Statistics. http://www.bearshare.com/stats/, 2005.
9
 
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.
 
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.
14
 
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.
 
17
J. Liang, R. Kumar, and K. W. Ross. The KaZaA Overlay: A Measurement Study. Computer Networks Journal (Elsevier), 2005.
18
 
19
Lime Wire LLC. Crawler Compatability. Gnutella Developer's Forum, 2003.
 
20
 
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.
 
22
S. Rhea, D. Geels, and J. Kubiatowicz. Handling Churn in a DHT. In USENIX, 2004.
 
23
 
24
25
 
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.

CITED BY  25

Collaborative Colleagues:
Daniel Stutzbach: colleagues
Reza Rejaie: colleagues