Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Modeling BitTorrent-like systems with many classes of users
Liao W., Papadopoulos F., Psounis K., Psomas C.  ACM Transactions on Modeling and Computer Simulation 23 (2): 1-25, 2013. Type: Article
Date Reviewed: Nov 18 2013

Large-scale distributions of digital content over the Internet require effective algorithms and systems. The traditional BitTorrent model has been successful in the distribution of files on peer-to-peer (P2P) systems for homogeneous users [1,2]. But in the real world, how should voluminous content be effectively distributed to heterogeneous users on diverse connections such as dial-up, digital subscriber line (DSL)/cable, and local area networks (LANs)?

Bram Cohen created the first BitTorrent client protocol in July 2001. However, the debate has continued for years over the best way to efficiently stream voluminous content over networks. In this paper, Liao et al. present two models for ascertaining the performance of BitTorrent-like systems. The first is a steady-state analytical model for predicting the performance of a system with a fixed number of users in a time period. The second is a fluid model that incorporates the transitory behaviors of several classes of users who vacate and connect to a system, to forecast the performance of BitTorrent-like systems.

The authors succinctly critique the deficiencies of the existing algorithms available for coping with BitTorrent traffic systems. They derive algorithms for minimizing download rates and delays for low-bandwidth, medium-bandwidth, and high-bandwidth users. They perform event-driven BitTorrent simulation experiments to gauge the performances of the algorithms in forecasting file download rates and delays. The results reveal that the proposed steady-state analytical and fluid models are reasonably accurate in predicting file download rates and, consequently, delays for categories of users. Clearly, the fluid model is the first of its kind to consider the time-related aspects of any number of user categories when estimating the download and delay rates in heterogeneous settings. Other than the failure to incorporate the variance in the number of neighbors that clients connect to, the fluid model supports effective file sharing and “eliminates the problem of freeriders [that] exploit optimistic unchoking in the original BitTorrent, since such users cannot accumulate any tokens.”

Reviewer:  Amos Olagunju Review #: CR141738 (1401-0071)
1) Menasche, D. S.; Rocha, A. A. A.; Li, B.; Towsley, D.; Venkataramani, A. Content availability and bundling in swarming systems. In Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies. ACM, 2009, 121–132.
2) Schulze, H.; Mochalsk, K. Internet study 2008/2009. ipoque, Tech. Rep., Feb. 2009, http://www.ipoque.com/sites/default/files/mediafiles/documents/internet-study-2008-2009.pdf.
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Applications (SMTP, FTP, etc.) (C.2.2 ... )
 
 
Model Validation And Analysis (I.6.4 )
 
 
Modeling Techniques (C.4 ... )
 
 
Performance of Systems (C.4 )
 
Would you recommend this review?
yes
no
Other reviews under "Applications (SMTP, FTP, etc.)": Date
Design and performance evaluation of NUMA-aware RDMA-based end-to-end data transfer systems
Ren Y., Li T., Yu D., Jin S., Robertazzi T.  SC 2013 (Proceedings of the International Conference for High-Performance Computing, Networking, Storage and Analysis, Denver, CO,  Nov 17-21, 2013) 1-10, 2013. Type: Proceedings
Aug 22 2014
Security model and framework for information aggregation in sensor networks
Manulis M., Schwenk J.  ACM Transactions on Sensor Networks 5(2): 1-28, 2009. Type: Article
Jun 26 2009
Fax, modem, and text for IP telephony
Hanes D., Salgueiro G.,  Cisco Press, 2008. 600 pp. Type: Book (9781587052699), Reviews: (2 of 2)
Feb 17 2009
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2017 ThinkLoud, Inc.
Terms of Use
| Privacy Policy