Dobjánné Antal, Elvira and Vinkó, Tamás (2016) On maximum throughput in BitTorrent. GRADUS, 3 (2). pp. 67-72. ISSN 2064-8014
|
Text
2016_2_CSC_009_Dobjanne.pdf Download (103kB) | Preview |
Abstract
The resource allocation problem reguesting maximum through- Put in BitTorrent networks is investigated. It is known from the iterature 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.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | resource allocation, flow network, BitTorrent, linear programming |
Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
Depositing User: | Zoltán Subecz |
Date Deposited: | 24 Jun 2020 15:46 |
Last Modified: | 03 Apr 2023 06:50 |
URI: | http://real.mtak.hu/id/eprint/110230 |
Actions (login required)
Edit Item |