Skip to main content
SpringerLink
Log in

Modeling max–min fair bandwidth allocation in BitTorrent communities

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

This paper gives an exact mathematical programming model and algorithm of the max–min fairness bandwidth allocation problem in multi-swarm peer-to-peer content sharing community. The proposed iterative method involves solution of LP and MILP problems of large scale. Based on real-world data traces, numerical experiments demonstrate that the new algorithm is computationally faster than an earlier developed one for larger problem sizes, and it provides better numerical stability. Moreover, even if its execution is stopped after some initial steps it still grants feasible solution with good approximation to max–min fairness.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Andrade, N., Santos-Neto, E., Brasileiro, F., Ripeanu, M.: Resource demand and supply in bittorrent content-sharing communities. Comput. Netw. 53(4), 515–527 (2009)

    Article  MATH  Google Scholar 

  2. Bertsekas, D.P., Gallager, R.G.: Data Networks, 2nd edn. Prentice Hall, Englewood Cliffs (1992)

    MATH  Google Scholar 

  3. Bonami, P., Kilinç, M., Linderoth, J.: Algorithms and software for convex mixed integer nonlinear programs. In: Santosa, F. (ed.) The IMA Volumes in Mathematics and its Applications, vol. 154, pp. 1–39. Springer, Berlin (2012)

    Google Scholar 

  4. Capotă, M., Andrade, N., Vinkó, T., Santos, F., Pouwelse, J., Epema, D.: Inter-swarm resource allocation in BitTorrent communities. In: Proceedings of IEEE International Conference on Peer-to-Peer Computing (P2P 2011), pp. 300–309 (2011)

  5. Cohen, B.: The BitTorrent protocol specification. http://bittorrent.org/beps/bep_0003.html. Accessed 19 Aug 2014

  6. Cohen, B.: Incentives build robustness in BitTorrent. In: Workshop on Economics of Peer-to-Peer systems, vol. 6, pp. 68–72 (2003)

  7. Eger, K., Killat, U.: Fair resource allocation in peer-to-peer networks (extended version). Comput. Commun. 30(16), 3046–3054 (2007)

    Article  Google Scholar 

  8. Fan, B., Lui, J.S., Chiu, D.M.: The design trade-offs of BitTorrent-like file sharing protocols. IEEE/ACM Trans. Netw. 17(2), 365–376 (2009)

    Article  Google Scholar 

  9. Fourer, R., Gay, D.M.: Experience with a primal presolve algorithm. In: Hager, W.W., Hearn, D.W., Pardalos, P.M. (eds.) Large Scale Optimization: State of the Art, pp. 135–154. Kluwer Academic Publishers, Dordrecht (1994)

    Chapter  Google Scholar 

  10. Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL. Boyd & Fraser, Danvers (1993)

    Google Scholar 

  11. Gay, D.M.: Symbolic-algebraic computations in a modeling language for mathematical programming. In: Alefeld, G., Rohn, J., Rump, S., Yamamoto, T. (eds.) Symbolic Algebraic Methods and Verification Methods, pp. 99–106. Springer, Berlin (2001)

    Chapter  Google Scholar 

  12. Gupte, A., Ahmed, S., Cheon, M., Dey, S.: Solving mixed integer bilinear problems using MILP formulations. SIAM J. Optim. 23(2), 721–744 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hahne, E.L.: Round-robin scheduling for max–min fairness in data networks. IEEE J. Sel. Areas Commun. 9(7), 1024–1039 (1991)

    Article  Google Scholar 

  14. Jain, R.: The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling. Wiley-Interscience, New York, NY (1991)

    MATH  Google Scholar 

  15. Ma, R.T.B., Lee, S.C.M., Lui, J.C.S., Yau, D.K.Y.: A game theoretic approach to provide incentive and service differentiation in P2P networks. SIGMETRICS Perform. Eval. Rev. 32, 189–198 (2004)

    Article  Google Scholar 

  16. Maier, G., Feldmann, A., Paxson, V., Allman, M.: On dominant characteristics of residential broadband Internet traffic. In: Proceedings of the 9th ACM SIGCOMM Internet Measurement Conference, ACM, pp. 90–102 (2009)

  17. Meulpolder, M., D’Acunto, L., Capotă, M., Wojciechowski, M., Pouwelse, J.A., Epema, D.H., Sips, H.J.: Public and private Bittorrent communities: a measurement study. In: Proceedings of the 9th International Workshop on Peer-to-Peer Systems (IPTPS) (2010)

  18. Mol, J.J.D., Bakker, A., Pouwelse, J., Epema, D., Sips H.: The design and deployment of a Bittorrent live video streaming solution. In: Proceedings of the 11th IEEE International Symposium on Multimedia, pp. 342–349 (2009)

  19. Radunović, B., Le Boudec, J.Y.: A unified framework for max–min and min-max fairness with applications. IEEE/ACM Trans. Netw. 15(5), 1073–1083 (2007)

    Article  Google Scholar 

  20. Tschorsch, F., Scheuermann, B.: Tor is unfair—and what to do about it. In: The Proceedings of the IEEE 36th Conference on Local Computer Networks (LCN), 2011, pp. 432–440 (2011)

  21. Vlavianos, A/, Iliofotou, M., Faloutsos, M.: BiToS: Enhancing BitTorrent for supporting streaming applications. In: Proceedings of the 25th IEEE INFOCOM, pp. 1–6 (2006)

  22. Wu, D., Liang, C., Liu, Y., Ross, K.: View-upload decoupling: A redesign of multi-channel p2p video systems. In: Proceedings of the IEEE INFOCOM 2009, pp. 2726 – 2730 (2009)

  23. Wu, D., Liang, Y., He, J., Hei, X.: Balancing performance and fairness in p2p live video systems. IEEE Trans. Circuits Syst. Video Technol. 23(6), 1029–1039 (2013)

    Article  Google Scholar 

  24. Yan, Y., El-Atawy, A., Al-Shaer, E.: Ranking-based optimal resource allocation in peer-to-peer networks. In: Proceedings of the 26th IEEE INFOCOM, pp. 1100–1108 (2007)

  25. Zhang, C., Dhungel, P., Wu, D., Liu, Z., Ross, K.: Bittorrent darknets. In: Proceedings of the IEEE INFOCOM 2010, pp. 1–9 (2010)

  26. Zhang, X., Liu, J., Li, B., Yum, T.S.: CoolStreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming. In: Proceedings of the IEEE INFOCOM 2005, pp. 2102–2111 (2005)

Download references

Acknowledgments

The authors would like to thank the anonymous reviewers for their valuable comments and suggestions to improve the quality of the paper. This work was partially supported by the European Union and the European Social Fund through project FuturICT.hu (Grant No.: TAMOP-4.2.2.C-11/1/KONV-2012-0013). T. Vinkó was supported by the Bolyai Scholarship of the Hungarian Academy of Sciences.

Author information

Authors and Affiliations

  1. Faculty of Mechanical Engineering and Automation, Kecskemét College, Kecskemet, Hungary

    Elvira Antal

  2. Institute of Informatics, University of Szeged, P.O. Box 652, Szeged, 6701, Hungary

    Tamás Vinkó

Authors
  1. Elvira Antal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tamás Vinkó
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tamás Vinkó.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Antal, E., Vinkó, T. Modeling max–min fair bandwidth allocation in BitTorrent communities. Comput Optim Appl 66, 383–400 (2017). https://doi.org/10.1007/s10589-016-9866-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-016-9866-5

Keywords

Search

Navigation