Article

Free access

Modeling and performance analysis of BitTorrent-like peer-to-peer networks

Authors:

R. SrikantAuthors Info & Claims

SIGCOMM '04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications

Pages 367 - 378

https://doi.org/10.1145/1015467.1015508

Published: 30 August 2004 Publication History

Abstract

In this paper, we develop simple models to study the performance of BitTorrent, a second generation peer-to-peer (P2P) application. We first present a simple fluid model and study the scalability, performance and efficiency of such a file-sharing mechanism. We then consider the built-in incentive mechanism of BitTorrent and study its effect on network performance. We also provide numerical results based on both simulations and real traces obtained from the Internet.

References

[1]

Entropia. http://www.entropia.com.

[2]

Top applications (bytes) for subinterface: SD-NAP traffic, 2002. www.caida.org/analysis/workload/byapplication/sdnap.

[3]

L. Arnold. Stochastic Differential Equations: Theory and Applications. John Wiley, New York, NY, 1974.

[4]

D. Bertsekas and R. Gallager. Data Networks. Prentice Hall, Englewood Cliffs, NJ, 1987.

Digital Library

[5]

P. Billingsley. Convergence of Probability Measures. Wiley, 1968.

[6]

F. Clevenot and P. Nain. A Simple Fluid Model for the Analysis of the Squirrel Peer-to-Peer Caching System. In Proceedings of IEEE INFOCOM, 2004.

[7]

F. Clevenot, P. Nain, and K. Ross. Stochastic Fluid Models for Cache Clusters. Technical Report 4815, INRIA, Sophia Antipolis, 2003. To appear in Performance Evaluation.

[8]

B. Cohen. Incentives build robustness in bittorrent, May 2003. http://bitconjurer.org/BitTorrent/bittorrentecon.pdf.

[9]

F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), Chateau Lake Louise, Banff, Canada, October 2001.

Digital Library

[10]

A. Das and R. Srikant. Diffusion approximations for a single node accessed by congestion-controlled sources. IEEE Transactions on Automatic Control, 45(10):1783--1799, October 1998.

[11]

G. de Veciana and X. Yang. Fairness, incentives and performance in peer-to-peer networks. In the Forty-first Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, Oct. 2003.

[12]

S. N. Ethier and T. G. Kurtz. Markov Processes: Characterization and Convergence. Wiley, 1994.

[13]

Z. Ge, D. R. Figueiredo, S. Jaiswal, J. Kurose, and D. Towsley. Modeling peer-peer file sharing systems. In Proceedings of IEEE INFOCOM, 2003.

[14]

P. W. Glynn. On the Markov property of the $GI/G/\infty$ Gaussian limit. Advances in Applied Probability, 14:191--194, 1982.

[15]

S. Iyer, A. Rowstron, and P. Druschel. Squirrel: A decentralized peer-to-peer web cache. In Proceedings of ACM Symposium on Principles of Distributed Computing (PODC '02), Monterey, California, 2002.

Digital Library

[16]

D. Liberzon and A. Morse. Basic problems in stability and design of switched systems. IEEE Control Systems Magazine, pages 59--70, 1999.

[17]

T. S. Eugene Ng, Y.-H. Chu, S. G. Rao, K. Sripanidkulchai, and Hui Zhang. Measurement-Based Optimization Techniques for Bandwidth-Demanding Peer-To-Peer Systems. In Proceedings of IEEE INFOCOM, 2003.

[18]

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proceedings of ACM SIGCOMM, 2001.

Digital Library

[19]

M. Ripeanu. Peer-to-peer architecture case study: Gnutella network. Technical report, University of Chicago, 2001.

Digital Library

[20]

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

[21]

I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishman. Chord: A scalable peer-to-peer lookup protocol for internet applications. In Proceedings of ACM SIGCOMM, 2001.

Digital Library

[22]

W. Whitt. On the heavy-traffic limit theorems for GI/G/∞ queues. Advances in Applied Probability, 14:171--190, 1982.

[23]

W. Whitt. Stochastic Process Limits. Springer, 2002.

[24]

X. Yang and G. de Veciana. Service Capacity of Peer to Peer Networks. In Proceedings of IEEE INFOCOM, 2004.

Cited By

Wu CHo J(2022)Time-Critical Data Dissemination Under Flash Crowd TrafficIEEE Open Journal of the Computer Society10.1109/OJCS.2022.31494113(11-22)Online publication date: 2022
https://doi.org/10.1109/OJCS.2022.3149411
Dhasade ADresevic NKermarrec APires R(2022)TEE-based decentralized recommender systems: The raw data sharing redemption2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS53621.2022.00050(447-458)Online publication date: May-2022
https://doi.org/10.1109/IPDPS53621.2022.00050
Lee UKim A(2021)Benefits of Mobile Contact Tracing on COVID-19: Tracing Capacity PerspectivesFrontiers in Public Health10.3389/fpubh.2021.5866159Online publication date: 18-Mar-2021
https://doi.org/10.3389/fpubh.2021.586615
Show More Cited By

Index Terms

Modeling and performance analysis of BitTorrent-like peer-to-peer networks
1. Computing methodologies
  1. Modeling and simulation
    1. Simulation theory
      1. Systems theory
2. Mathematics of computing
  1. Information theory

Recommendations

Modeling and performance analysis of BitTorrent-like peer-to-peer networks

In this paper, we develop simple models to study the performance of BitTorrent, a second generation peer-to-peer (P2P) application. We first present a simple fluid model and study the scalability, performance and efficiency of such a file-sharing ...
Distributed proximity-aware peer clustering in bittorrent-like peer-to-peer networks
EUC'06: Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing

In this paper, we propose a hierarchical architecture for grouping peers into clusters in a large-scale BitTorrent-like underlying overlay network in such a way that clusters are evenly distributed and that the peers within are relatively close together. ...
Cost-effective broadcast for fully decentralized peer-to-peer networks

Fully unstructured and decentralized peer-to-peer networks such as Gnutella are appealing for a variety of applications, among which file-sharing is the most prominent one. The decentralized nature of these systems provides a high degree of robustness ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications

August 2004

402 pages

ISBN:1581138628

DOI:10.1145/1015467

General Chair:
Raj Yavatkar
Intel Corporation
,
Program Chairs:
Ellen Zegura
Georgia Institute of Technology
,
Jennifer Rexford
AT&T Labs -- Research

ACM SIGCOMM Computer Communication Review Volume 34, Issue 4
October 2004
385 pages
ISSN:0146-4833
DOI:10.1145/1030194
Issue’s Table of Contents

Copyright © 2004 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: 30 August 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGCOMM04

Sponsor:

SIGCOMM04: ACM SIGCOMM 2004 Conference

August 30 - September 3, 2004

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 554 of 3,547 submissions, 16%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1,004
Total Citations
View Citations
7,892
Total Downloads

Downloads (Last 12 months)128
Downloads (Last 6 weeks)8

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wu CHo J(2022)Time-Critical Data Dissemination Under Flash Crowd TrafficIEEE Open Journal of the Computer Society10.1109/OJCS.2022.31494113(11-22)Online publication date: 2022
https://doi.org/10.1109/OJCS.2022.3149411
Dhasade ADresevic NKermarrec APires R(2022)TEE-based decentralized recommender systems: The raw data sharing redemption2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS53621.2022.00050(447-458)Online publication date: May-2022
https://doi.org/10.1109/IPDPS53621.2022.00050
Lee UKim A(2021)Benefits of Mobile Contact Tracing on COVID-19: Tracing Capacity PerspectivesFrontiers in Public Health10.3389/fpubh.2021.5866159Online publication date: 18-Mar-2021
https://doi.org/10.3389/fpubh.2021.586615
Rattaro CAspirot LMordecki EBelzarena P(2020)QoS Provision in a Dynamic Channel Allocation Based on Admission Control DecisionsACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/33727865:1(1-29)Online publication date: 4-Feb-2020
https://dl.acm.org/doi/10.1145/3372786
Bilgen OWagner A(2020)A New Stable Peer-to-Peer Protocol With Non-Persistent Peers: The Group Suppression ProtocolIEEE Transactions on Information Theory10.1109/TIT.2019.294665666:1(614-632)Online publication date: Jan-2020
https://doi.org/10.1109/TIT.2019.2946656
Lim M(2020)C2CFTP: Direct and Indirect File Transfer Protocols Between Clients in Client-Server ArchitectureIEEE Access10.1109/ACCESS.2020.29987258(102833-102845)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2998725
Beirami AFekri F(2020)Network Traffic Compression With Side InformationIEEE Access10.1109/ACCESS.2020.29943198(90023-90034)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2994319
Moon YLim M(2019)An Enhanced File Transfer Mechanism Using an Additional Blocking Communication Channel and Thread for IoT EnvironmentsSensors10.3390/s1906127119:6(1271)Online publication date: 13-Mar-2019
https://doi.org/10.3390/s19061271
Zhang HLu NSun HLi JSong R(2019)A Novel Dynamic Energy Model for the Energy-Harvesting IoT NodeProceedings of the 2019 7th International Conference on Information Technology: IoT and Smart City10.1145/3377170.3377174(328-333)Online publication date: 20-Dec-2019
https://dl.acm.org/doi/10.1145/3377170.3377174
Wang XXiao DLi XCline DLoguinov D(2019)Consistent Sampling of Churn Under Periodic Non-Stationary Arrivals in Distributed SystemsACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/33685104:4(1-33)Online publication date: 10-Dec-2019
https://dl.acm.org/doi/10.1145/3368510
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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

Media

Figures

Other

Tables

View Table of Contents