Dongyu Qiu
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.
- Entropia. http://www.entropia.com.Google Scholar
- Top applications (bytes) for subinterface: SD-NAP traffic, 2002. www.caida.org/analysis/workload/byapplication/sdnap.Google Scholar
- L. Arnold. Stochastic Differential Equations: Theory and Applications. John Wiley, New York, NY, 1974.Google Scholar
- D. Bertsekas and R. Gallager. Data Networks. Prentice Hall, Englewood Cliffs, NJ, 1987. Google ScholarDigital Library
- P. Billingsley. Convergence of Probability Measures. Wiley, 1968.Google Scholar
- 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.Google ScholarCross Ref
- 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.Google Scholar
- B. Cohen. Incentives build robustness in bittorrent, May 2003. http://bitconjurer.org/BitTorrent/bittorrentecon.pdf.Google Scholar
- 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. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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.Google Scholar
- S. N. Ethier and T. G. Kurtz. Markov Processes: Characterization and Convergence. Wiley, 1994.Google Scholar
- Z. Ge, D. R. Figueiredo, S. Jaiswal, J. Kurose, and D. Towsley. Modeling peer-peer file sharing systems. In Proceedings of IEEE INFOCOM, 2003.Google ScholarCross Ref
- P. W. Glynn. On the Markov property of the $GI/G/\infty$ Gaussian limit. Advances in Applied Probability, 14:191--194, 1982.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- D. Liberzon and A. Morse. Basic problems in stability and design of switched systems. IEEE Control Systems Magazine, pages 59--70, 1999.Google Scholar
- 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.Google Scholar
- S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proceedings of ACM SIGCOMM, 2001. Google ScholarDigital Library
- M. Ripeanu. Peer-to-peer architecture case study: Gnutella network. Technical report, University of Chicago, 2001.Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- W. Whitt. On the heavy-traffic limit theorems for GI/G/∞ queues. Advances in Applied Probability, 14:171--190, 1982.Google ScholarCross Ref
- W. Whitt. Stochastic Process Limits. Springer, 2002.Google ScholarCross Ref
- X. Yang and G. de Veciana. Service Capacity of Peer to Peer Networks. In Proceedings of IEEE INFOCOM, 2004.Google Scholar
Index Terms
- Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Recommendations
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
SIGCOMM '04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communicationsIn 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 ComputingIn 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