Abstract
In this paper, a linear max-min fairness (LMMF) approach using goal programming is proposed. The linear model in this approach is a bi-objective model where the flow is maximized in one objective, and the fairness in flow is maximized for the other objective. This model can be applied to max- min fairness (MMF) problems in networks with applications to multi-commodity flows in networks. The proposed model provides high flexibility for the decision maker to determine the level of throughput and the fairness of flow in the network. The goal of this paper is to find a less-complex approach to find MMF flow in multi-commodity networks. An example is presented to illustrate the methodology.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Nace, D., Pi, M.: Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial. IEEE Commun. Surv. Tutor. 10(4), 5–17 (2008)
Megiddo, N.: Optimal flows in networks with multiple sources and sinks. Math. Program. 7, 97–107 (1974)
Nace, D., Doan, N., Gourdin, E., Liau, B.: Computing optimal max-min fair resource allocation for elastic flows, EEE Trans. Netw. 14, 1272–1281 (2006)
Bertsekas, D., Hall, P.: Data Networks. Prentice-Hall, Engelwood Cliffs, N.J. (1992)
Chen, S., Nahrstedt, K.: Maxmin fair routing in connection-oriented networks 1 introduction. In: Euro-Parallel and Distributed Systems Conference, pp. 163–168, Vienna Austria, (July 1998)
Nilsson, P., Pioro, M., Dziong, Z.: Link protection within an existing backbone network. In: Proceedings of International Network Optimization Conference (2003)
Danna, E., Mandal, S., Singh, A.: A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering. In: Proceedings IEEE INFOCOM, pp. 846–854 (2012)
Mollah, Md.A., YuanFast, X., Pakin, S., Lang, M.: Calculation of max-min fair rates for multi-commodity flows in fat-tree networks. In: IEEE International Conference on Cluster Computing, pp. 351–360 (2015)
Retvari, G., Biro, J.J., Cinkler, T.: Fairness in capacitated networks: a polyhedral approach. In: IEEE INFOCOM 2007-26th IEEE International Conference on Computer Communications, pp. 1604–1612 (2007)
Cohen, E., Megiddo, N.: Algorithms and complexity analysis for some flow problems. Algorithmica 11(3), 320–340 (1994). (March 1994)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Bin Obaid, H., Trafalis, T.B. (2017). Linear Max-Min Fairness in Multi-commodity Flow Networks. In: Kalyagin, V., Nikolaev, A., Pardalos, P., Prokopyev, O. (eds) Models, Algorithms, and Technologies for Network Analysis. NET 2016. Springer Proceedings in Mathematics & Statistics, vol 197. Springer, Cham. https://doi.org/10.1007/978-3-319-56829-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-56829-4_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-56828-7
Online ISBN: 978-3-319-56829-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)