Modeling max–min fair bandwidth allocation in BitTorrent communities

Elvira Antal () and Tamás Vinkó ()
Additional contact information
Elvira Antal: Faculty of Mechanical Engineering and Automation, Kecskemét College
Tamás Vinkó: University of Szeged

Computational Optimization and Applications, 2017, vol. 66, issue 2, No 8, 383-400

Abstract: 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.

Keywords: BitTorrent communities; Resource allocation; Max–min fairness; MILP (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-016-9866-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:66:y:2017:i:2:d:10.1007_s10589-016-9866-5

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-016-9866-5

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().