Gradus

VOL 3, NO 2 (2016): AUTUMN (NOVEMBER)

 

On maximum throughput in BitTorrent


Elvira Dobjánné Antal, and Tamás Vinkó

Abstract

The resource allocation problem requesting maximum through- put in BitTorrent networks is investigated. It is known from the literature that the total throughput of BitTorrent is far from the the- oretical maximum. However, direct implementation of the uncon- strained maximum flow model into BitTorrent is not desirable, due to the necessity of further social considerations. This paper aims to produce more realistic upper bound for maximum throughput in BitTorrent networks by suggesting new model variants to move the maximum flow model closer to the rules of a typical BitTorrent community. Numerical experiments are done on those modified models, introducing lower bounds and balancing constraints on the amount of downloading and uploading, to verify their impact. Additionally, computational results are presented for comparing the network linear program model and the standard algebraic model of the maximum flow problem in AMPL.


Keywords

Keywords: resource allocation, flow network, BitTorrent, linear programming,


References

[1] N. Andrade, E. Santos-Neto, F. Brasileiro, M. Ripeanu, “Resource demand and supply in BitTor-rent content-sharing communities,” Computer Networks, vol. 53, no. 4, pp. 515–527, 2009.
[2] J. Roozenburg, “Secure decentralized swarm discovery in Tribler,” Master’s thesis, Delft Univer-sity of Technology, 2006.
[3] B. Cohen, “Incentives build robustness in BitTorrent,” in: Workshop on Economics of Peer-to-Peer systems, vol. 6, 2003, pp. 68–72.
[4] M. Capota, N. Andrade, T. Vinkó, F. Santos, J. Pouwelse, D. Epema, “Inter-swarm resource allo-cation in BitTorrent communities,” in: IEEE International Conference on Peer-to-Peer Computing(P2P), 2011, pp. 300–309.
[5] R. Fourer, D.M. Gay, B.W. Kernighan, “AMPL,” Boyd & Fraser, Danvers, 1993.
[6] R. Fourer, D.M. Gay., “Expressing special structures in an algebraic modeling language for math-ematical programming,” ORSA Journal on computing, vol. 7, no. 2, pp. 166–190, 1995.
[7] A. V. Goldberg, R. E. Tarjan, “A new approach to the maximum-flow problem,” J. ACM, vol. 35,no. 4, pp. 921–940, 1988.
[8] T. Vinkó and B. Botyánszki, “Empirical investigation of BitTorrent community graphs,” Computing,vol. 98, pp. 567–582, 2016.



Copyright (c) 2019 Gradus