An approximation to max min fairness in multi commodity networks

Hamoud S. Bin Obaid () and Theodore B. Trafalis ()
Additional contact information
Hamoud S. Bin Obaid: University of Oklahoma
Theodore B. Trafalis: University of Oklahoma

Computational Management Science, 2020, vol. 17, issue 1, No 4, 65-77

Abstract: Abstract The two objectives of max min fairness (MMF) in multi commodity networks are maximizing the overall throughput so the network operator is satisfied when network is utilized, and minimizing the overall difference in throughput between commodities satisfying the users with fair bandwidth allocation. These two objectives are conflicting, so are translated into a bi-objective model where throughput is maximized in one objective, and the difference in flow between commodities is minimized in the other objective. The proposed approach in this paper is meant to handle large scale networks since the common approaches are feasible only on small to medium scale networks. Although the solution is an approximation to MMF, but it can be exact to the MMF solution when ɛ is properly selected. An illustrative example is discussed in addition to experimentations on real and random networks. The experimentations show the effectiveness of the proposed model.

Keywords: Max min fairness; Load balancing; Traffic engineering; Goal programming (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10287-018-0336-7 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:comgts:v:17:y:2020:i:1:d:10.1007_s10287-018-0336-7

Ordering information: This journal article can be ordered from
http://www.springer. ... ch/journal/10287/PS2

DOI: 10.1007/s10287-018-0336-7

Access Statistics for this article

Computational Management Science is currently edited by Ruediger Schultz

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