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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bashllari A, Nace D, Gourdin E, Klopfenstein O (2007) The MMF rerouting computation problem, pp 1–6
Bertsekas D, Hall P (1992) Data networks. Prentice-Hall, Engelwood Cliffs
Le Boudec J (2007) A unified framework for max–min and min–max fairness with applications. IEEE/ACM Trans Netw 15(5):1073–1083
Carvalho R, Buzna L, Just W, Helbing D, Arrowsmith DK (2012) Fair sharing of resources in a supply network with constraints. Phys Rev E Stat Nonlinear Soft Matter Phys 85(4): Article ID046101
Cohen E, Megiddo N (1991) Algorithms and complexity analysis for some flow problems. Algorithmica 11:1–21
Coniglio S (2014) Maximum throughput network routing subject to fair flow allocation, vol 8596. Springer, Berlin, pp 1–12
Danna E, Mandal S, Singh A (2012) A practical algorithm for balancing the max–min fairness and throughput objectives in traffic engineering. Proc IEEE INFOCOM 14:846–854
Hulme D, Mosley P (1996) Finance against poverty, vol 2. Psychology Press, London
Leclerc PD, McLay LA, Mayorga ME (2012) Modeling equity for allocating public resources. Community-based operations research. Springer, New York, pp 97–118
Megiddo N (1974) Optimal flows in networks with multiple sources and sinks. Math Program 7:97–107
Nace D, Pi M (2008) Max–min fairness and its applications to routing and load-balancing in communication networks: a tutorial. IEEE Commun Surv Tutor 10(4):5–17
Nace D, Doan LN, Klopfenstein O, Bashllari A (2006) Max–min fairness in multi-commodity flows. Comput Oper Res 35(2):557–573
Orlowski S, Wessäly R, Pióro M, Tomaszewski A (2010) SNDlib 1.0—survivable network design library. Networks 55(3):276–286
Rétvári G, Bíró JJ, Cinkler T (2007) Fairness in capacitated networks: a polyhedral approach. In: IEEE INFOCOM (2016). http://doi.org/10.1109/INFCOM.2007.188
Acknowledgements
Dr. Theodore Trafalis was supported by RSF Grant 14-41-00039 and he conducted research at National Research University Higher School of Economics.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bin Obaid, H.S., Trafalis, T.B. An approximation to max min fairness in multi commodity networks. Comput Manag Sci 17, 65–77 (2020). https://doi.org/10.1007/s10287-018-0336-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10287-018-0336-7