Article

Characterizing unstructured overlay topologies in modern P2P file-sharing systems

Authors:

Daniel Stutzbach,

Subhabrata SenAuthors Info & Claims

IMC '05: Proceedings of the 5th ACM SIGCOMM conference on Internet measurement

Page 5

Published: 19 October 2005 Publication History

Publisher Site Get Access

Abstract

During recent years, peer-to-peer (P2P) file-sharing systems have evolved in many ways to accommodate growing numbers of participating peers. In particular, new features have changed the properties of the unstructured overlay topology formed by these peers. Despite their importance, little is known about the characteristics of these topologies and their dynamics in modern file-sharing applications.

This paper presents a detailed characterization of P2P overlay topologies and their dynamics, focusing on the modern Gnutella network. Using our fast and accurate P2P crawler, we capture a complete snapshot of the Gnutella network with more than one million peers in just a few minutes. Leveraging more than 18,000 recent overlay snapshots, we characterize the graph-related properties of individual overlay snapshots and overlay dynamics across hundreds of back-to-back snapshots. We show how inaccuracy in snapshots can lead to erroneous conclusions--such as a power-law degree distribution. Our results reveal that while the Gnutella network has dramatically grown and changed in many ways, it still exhibits the clustering and short path lengths of a small world network. Furthermore, its overlay topology is highly resilient to random peer departure and even systematic attacks. More interestingly, overlay dynamics lead to an "onion-like" biased connectivity among peers where each peer is more likely connected to peers with higher uptime. Therefore, long-lived peers form a stable core that ensures reachability among peers despite overlay dynamics.

References

[1]

{1} slyck.com. http://www.slyck.com, 2005.]]

[2]

{2} L. A. Adamic, R. M. Lukose, B. Huberman, and A. R. Puniyani. Search in Power-Law Networks. Physical Review E, 64(46135), 2001.]]

[3]

{3} E. Adar and B. A. Huberman. Free riding on gnutella. First Monday, 5(10), Oct. 2000.]]

[4]

{4} F. S. Annexstein, K. A. Berman, and M. A. Jovanovic. Latency effects on reachability in large-scale peer-to-peer networks. In Symposium on Parallel Algorithms and Architectures, pages 84-92, 2001.]]

Digital Library

[5]

{5} Y. Chawathe, S. Ratnasamy, and L. Breslau. Making Gnutella-like P2P Systems Scalable. In SIGCOMM, 2003.]]

Digital Library

[6]

{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, July 2002.]]

[7]

{7} clip2.com. Gnutella: To the Bandwidth Barrier and Beyond, Nov. 2000.]]

[8]

{8} M. Faloutsos, P. Faloutsos, and C. Faloutsos. On Power-Law Relationships of the Internet Topology. In SIGCOMM, 1999.]]

Digital Library

[9]

{9} A. Fisk. Gnutella Dynamic Query Protocol v0.1. Gnutella Developer's Forum, May 2003.]]

[10]

{10} 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

[11]

{11} Q. He and M. Ammar. Congestion Control and Message Loss in Gnutella Networks. In Multimedia Computing and Networking, Jan. 2004.]]

[12]

{12} M. Jovanovic, F. Annexstein, and K. Berman. Modeling Peer-to-Peer Network Topologies through "Small-World" Models and Power Laws. In TELFOR, Nov. 2001.]]

[13]

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

[14]

{14} T. Karagiannis, A. Broido, M. Faloutsos, and kc claffy. Transport Layer Identification of P2P Traffic. In International Measurement Conference, Oct. 2004.]]

Digital Library

[15]

{15} P. Karbhari, M. Ammar, A. Dhamdhere, H. Raj, G. Riley, and E. Zegura. Bootstrapping in Gnutella: A Measurement Study. In PAM, Apr. 2004.]]

[16]

{16} A. Klemm, C. Lindemann, M. Vernon, and O. P. Waldhorst. Characterizing the Query Behavior in Peer-to-Peer File Sharing Systems. In Internet Measurement Conference, Oct. 2004.]]

Digital Library

[17]

{17} N. Leibowitz, M. Ripeanu, and A. Wierzbicki. Deconstructing the Kazaa Network. In WIAPP, 2003.]]

Digital Library

[18]

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

Digital Library

[19]

{19} J. Liang, R. Kumar, Y. Xi, and K. W. Ross. Pollution in P2P File Sharing Systems. In INFOCOM, Mar. 2005.]]

[20]

{20} Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and Replication in Unstructured Peer-to-Peer Networks. In International Conference on Supercomputing, 2002.]]

Digital Library

[21]

{21} Q. Lv, S. Ratnasamy, and S. Shenker. Can heterogeneity make Gnutella scalable? In IPTPS, 2002.]]

Digital Library

[22]

{22} S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In SIGCOMM, 2001.]]

Digital Library

[23]

{23} M. Ripeanu, I. Foster, and A. Iamnitchi. Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design. IEEE Internet Computing Journal, 6(1), 2002.]]

Digital Library

[24]

{24} S. Saroiu, P. K. Gummadi, and S. D. Gribble. Measuring and Analyzing the Characteristics of Napster and Gnutella Hosts. Multimedia Systems Journal, 8(5), Nov. 2002.]]

Digital Library

[25]

{25} S. Sen and J. Wang. Analyzing Peer-To-Peer Traffic Across Large Networks. IEEE/ACM Transactions on Networking, 12(2):219-232, Apr. 2004.]]

Digital Library

[26]

{26} K. Sripanidkulchai. The popularity of Gnutella queries and its implications on scalability. http://www-2.cs.cmu.edu/kunwadee/research/p2p/paper.html, Jan. 2001.]]

[27]

{27} K. Sripanidkulchai, B. Maggs, and H. Zhang. Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems. In INFOCOM, 2003.]]

[28]

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

Digital Library

[29]

{29} I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications. IEEE/ACM Transactions on Networking, 2002.]]

Digital Library

[30]

{30} D. Stutzbach and R. Rejaie. Capturing Accurate Snapshots of the Gnutella Network. In Global Internet Symposium, pages 127-132, Mar. 2005.]]

[31]

{31} D. Stutzbach and R. Rejaie. Characterizing Churn in Peer-to-Peer Networks. Technical Report 2005-03, University of Oregon, May 2005.]]

[32]

{32} D. Stutzbach and R. Rejaie. Characterizing the Two-Tier Gnutella Topology. In SIGMETRICS, Extended Abstract, June 2005.]]

Digital Library

[33]

{33} D. Stutzbach and R. Rejaie. Evaluating the Accuracy of Captured Snapshots by Peer-to-Peer Crawlers. In Passive and Active Measurement Workshop, Extended Abstract, pages 353-357, Mar. 2005.]]

Digital Library

[34]

{34} H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network Topology Generators: Degree-Based vs. Structural. In SIGCOMM, 2002.]]

Digital Library

[35]

{35} D. J. Watts. Six Degrees. In The Essence of a Connected Edge. ACM Press, 2003.]]

[36]

{36} R. H. Wouhaybi and A. T. Campbell. Phenix: Supporting Resilient Low-Diameter Peer-to-Peer Topologies. In INFOCOM, 2004.]]

[37]

{37} B. Yang and H. Garcia-Molina. Designing a Super-Peer Network. In International Conference on Data Engineering, Mar. 2003.]]

[38]

{38} B. Yang, P. Vinograd, and H. Garcia-Molina. Evaluating GUESS and Non-Forwarding Peer-to-Peer Search. In IEEE International Conference on Distributed Systems, 2004.]]

Digital Library

Cited By

Karuppayah SB�ck LGrube TManickam SM�hlh�user MFischer M(2017)SensorBusterProceedings of the 12th International Conference on Availability, Reliability and Security10.1145/3098954.3098991(1-6)Online publication date: 29-Aug-2017
https://dl.acm.org/doi/10.1145/3098954.3098991
Ben-Gal IShavitt YWeinsberg EWeinsberg U(2014)Peer-to-peer information retrieval using shared-content clusteringKnowledge and Information Systems10.1007/s10115-013-0619-939:2(383-408)Online publication date: 1-May-2014
https://dl.acm.org/doi/10.1007/s10115-013-0619-9
Raftopoulou PPetrakis E(2010)Peer rewiring in semantic overlay networks under churnProceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I10.5555/1947725.1947776(573-581)Online publication date: 25-Oct-2010
https://dl.acm.org/doi/10.5555/1947725.1947776
Show More Cited By

Index Terms

Characterizing unstructured overlay topologies in modern P2P file-sharing systems

Recommendations

Characterizing unstructured overlay topologies in modern P2P file-sharing systems

In recent years, peer-to-peer (P2P) file-sharing systems have evolved to accommodate growing numbers of participating peers. In particular, new features have changed the properties of the unstructured overlay topologies formed by these peers. Little is ...
Comparative Analysis of Unstructured P2P File Sharing Networks
ICISDM '19: Proceedings of the 2019 3rd International Conference on Information System and Data Mining

Numerous P2P networks are available covering different areas of P2P technologies. Since P2P network overlays are good for creating large scale content distribution and data sharing applications, an ample amount of effort has been made to improve the ...
On Optimizing Overlay Topologies for Search in Unstructured Peer-to-Peer Networks

Unstructured peer-to-peer (P2P) file-sharing networks are popular in the mass market. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest and thus introduce ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

IMC '05: Proceedings of the 5th ACM SIGCOMM conference on Internet measurement

October 2005

389 pages

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

USENIX Association

United States

Publication History

Published: 19 October 2005

Check for updates

Qualifiers

Article

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

38
Total Citations
View Citations
230
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Karuppayah SBöck LGrube TManickam SMühlhäuser MFischer M(2017)SensorBusterProceedings of the 12th International Conference on Availability, Reliability and Security10.1145/3098954.3098991(1-6)Online publication date: 29-Aug-2017
https://dl.acm.org/doi/10.1145/3098954.3098991
Ben-Gal IShavitt YWeinsberg EWeinsberg U(2014)Peer-to-peer information retrieval using shared-content clusteringKnowledge and Information Systems10.1007/s10115-013-0619-939:2(383-408)Online publication date: 1-May-2014
https://dl.acm.org/doi/10.1007/s10115-013-0619-9
Raftopoulou PPetrakis E(2010)Peer rewiring in semantic overlay networks under churnProceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I10.5555/1947725.1947776(573-581)Online publication date: 25-Oct-2010
https://dl.acm.org/doi/10.5555/1947725.1947776
Rasti ARejaie RWillinger W(2010)Characterizing the global impact of P2P overlays on the AS-level underlayProceedings of the 11th international conference on Passive and active measurement10.5555/1889324.1889325(1-10)Online publication date: 7-Apr-2010
https://dl.acm.org/doi/10.5555/1889324.1889325
Girdzijauskas ŠDatta AAberer K(2010)Structured overlay for heterogeneous environmentsACM Transactions on Autonomous and Adaptive Systems10.1145/1671948.16719505:1(1-25)Online publication date: 25-Feb-2010
https://dl.acm.org/doi/10.1145/1671948.1671950
Dai JLiu FLi B(2010)The disparity between P2P overlays and ISP underlaysIEEE Network: The Magazine of Global Internetworking10.1109/MNET.2010.563444124:6(36-41)Online publication date: 1-Nov-2010
https://dl.acm.org/doi/10.1109/MNET.2010.5634441
Kolbe HKettig OGolic E(2009)Monitoring the impact of P2P users on a broadband operator's networkProceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management10.5555/1688933.1688989(351-358)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.5555/1688933.1688989
Ruffo GSchifanella R(2009)A peer-to-peer recommender system based on spontaneous affinitiesACM Transactions on Internet Technology10.1145/1462159.14621639:1(1-34)Online publication date: 23-Feb-2009
https://dl.acm.org/doi/10.1145/1462159.1462163
Stutzbach DRejaie RDuffield NSen SWillinger W(2009)On unbiased sampling for unstructured peer-to-peer networksIEEE/ACM Transactions on Networking10.1109/TNET.2008.200173017:2(377-390)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.1109/TNET.2008.2001730
Wang XYao ZLoguinov D(2009)Residual-based estimation of peer and link lifetimes in P2P networksIEEE/ACM Transactions on Networking10.1109/TNET.2008.200172717:3(726-739)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.1109/TNET.2008.2001727
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