Abstract
Peer-to-peer (P2P) overlay networks such as BitTorrent and Avalanche are increasingly used for disseminating potentially large files from a server to many end users via the Internet. The key idea is to divide the file into many equally-sized parts and then let users download each part (or, for network coding based systems such as Avalanche, linear combinations of the parts) either from the server or from another user who has already downloaded it. However, their performance evaluation has typically been limited to comparing one system relative to another and has typically been realized by means of simulation and measurements. By contrast, we provide an analytic performance analysis that is based on a new uplink-sharing version of the well-known broadcasting problem. Assuming equal upload capacities, we show that the minimal time to disseminate the file is the same as for the simultaneous send/receive version of the broadcasting problem. For general upload capacities, we provide a mixed integer linear program (MILP) solution and a complementary fluid limit solution. We thus provide a lower bound which can be used as a performance benchmark for any P2P file dissemination system. We also investigate the performance of a decentralized strategy, providing evidence that the performance of necessarily decentralized P2P file dissemination systems should be close to this bound and, therefore, that it is useful in practice.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahlswede, R., Cai, N., Li, S.-Y. R., & Yeung, R. W. (2000). Network information flow. IEEE Transactions on Information Theory, 46, 1204–1216.
Bar-Noy, A., Kipnis, S., & Schieber, B. (2000). Optimal multiple message broadcasting in telephone-like communication systems. Discrete Applied Mathematics, 100, 1–15.
Bharambe, A. R., Herley, C., & Padmanabhan, V. N. (2005). Some observations on BitTorrent performance. Performance Evaluation Review, 33(1), 398–399.
Bollobás, B. (1998). Modern graph theory. New York: Springer.
Castro, C., Druschel, P., Kermarrec, A.-M., Nandi, A., Rowstron, A., & Singh, A. (2003). Splitstream: high-bandwidth multicast in cooperative environments. In 19th ACM symposium on operating systems principles (SOSP’03).
Cockayne, E. J., & Thomason, A. G. (1980). Optimal multimessage broadcasting in complete graphs. Utilitas Mathematica, 18, 181–199.
Cohen, B. (2003). Incentives build robustness in BitTorrent. In Proceedings of the workshop on economics of peer-to-peer systems, Berkeley, CA.
Farley, A. M. (1980). Broadcast time in communication networks. SIAM Journal on Applied Mathematics, 39(2), 385–390.
Franklin, M., & Zdonik, S. (1997). A framework for scalable dissemination-based systems. ACM SIGPLAN Notices, 32(10), 94–105.
Gkantsidis, C., & Rodriguez, P. (2005). Network coding for large scale content distribution. In IEEE INFOCOM 2005, March 2005.
Guo, L., Chen, S., Xiao, Z., Tan, E., Ding, X., & Zhang, X. (2005). Measurements, analysis, and modeling of BitTorrent-like systems. In Proceedings of Internet measurement conference 2005 (IMC 2005), October 2005.
Hastie, T., & Tibshirani, R. (1990). Generalized additive models. London: Chapman and Hall.
Hedetniemi, S. M., Hedetniemi, S. T., & Liestman, A. L. (1988). A survey of gossiping and broadcasting in communication networks. Networks, 18(4), 319–349.
Hromkovic, J., Klasing, R., Monien, B., & Peine, R. (1995). Combinatorial network theory. In F. Hsu & D.-Z. Du (Eds.), Dissemination of information in interconnection networks (broadcasting and gossiping) (pp. 125–212). Dordrecht: Kluwer Academic.
Izal, M., Urvoy-Keller, G., Biersack, E., Felber, P., Hamra, A. A., & Garcés-Erice, L. (2004). Dissecting BitTorrent: five months in a torrent’s lifetime. In Passive and active measurements.
Johnson, N. L., Kotz, S., & Kemp, A. W. (1993). Univariate discrete distributions. New York: Wiley.
Karagiannis, T., Broido, A., Brownlee, N., Claffy, K., & Faloutsos, M. (2004). Is P2P dying or just hiding? In IEEE Globecom 2004—global Internet and next generation networks, November 2004.
Kostić, D., Braud, R., Killian, C., Vandekieft, E., Anderson, J. W., Snoeren, A. C., & Vahdat, A. (2005). Maintaining high-bandwidth under dynamic network conditions. In USENIX 2005 annual technical conference.
Kwon, C.-H., & Chwa, K.-Y. (1995). Multiple message broadcasting in communication networks. Networks, 26, 253–261.
Massoulié, L., & Vojnović, M. (2005). Coupon replication systems. In ACM Sigmetrics 2005, June 2005.
Mundinger, J. (2005). Analysis of peer-to-peer systems in communication networks. Cambridge University: PhD thesis.
Mundinger, J., & Weber, R. R. (2004). Efficient content distribution using peer-to-peer technology. In C. Griwodz, T. P. Plagemann, & R. Steinmetz, (Eds.), Abstracts collection—content distribution infrastructures. Dagstuhl seminar proceedings (p. 04201).
Mundinger, J., Weber, R. R., & Weiss, G. (2006a). Analysis of peer-to-peer file dissemination. SIGMETRICS Performance Evaluation Review, 34(3), 12–14.
Mundinger, J., Weber, R. R., & Weiss, G. (2006b). Analysis of peer-to-peer file dissemination amongst users of different upload capacities. SIGMETRICS Performance Evaluation Review, 34(2), 5–6.
Parker, A. (2004). The true picture of peer-to-peer filesharing. CacheLogic. http://www.cachelogic.com/.
Pouwelse, J. A., Garbacki, P., Epema, D. H. J., & Sips, H. J. (2005). The Bittorrent P2P file-sharing system: Measurements and analysis. In 4th international workshop on peer-to-peer systems (IPTPS’05), February 2005.
Qiu, D., & Srikant, R. (2004). Modeling and performance analysis of BitTorrent-like peer-to-peer networks. In Proc. ACM SIGCOMM, September 2004.
Ramachandran, K. K., & Sikdar, B. (2005). An analytic framework for modeling peer to peer networks. In IEEE INFOCOM 2005.
Sherwood, R., Braud, R., & Bhattacharjee, B. (2004). Slurpie: A cooperative bulk data transfer protocol. In IEEE INFOCOM 2004.
Srikant, R. (2004). The mathematics of Internet congestion control. Basel: Birkhäuser.
Yang, X., & de Veciana, G. (2004). Service capacity of peer to peer networks. In IEEE INFOCOM 2004.
Yang, X., & de Veciana, G. (2005). Performance of peer-to-peer networks: service capacity and role of resource sharing policies. Performance Evaluation, Special Issue on Performance Modeling and Evaluation of P2P Computing Systems.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research of G. Weiss is supported in part by Israel Science Foundation Grants 249/02 and 454/05.
Collaboration of the authors was supported in part by European Network of Excellence Euro-NGI.
Rights and permissions
About this article
Cite this article
Mundinger, J., Weber, R. & Weiss, G. Optimal scheduling of peer-to-peer file dissemination. J Sched 11, 105–120 (2008). https://doi.org/10.1007/s10951-007-0017-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-007-0017-9