Max–min fairness in multi-commodity flows

Nace D, Orlin JB. Lexicographically minimum and maximum load linear programming problems. Operations Research, to appear. Bertsekas, 1992 Kleinberg, 1999, Fairness in routing and load balancing Nace D. A linear programming based approach for computing optimal splittable fair routing. In: Proceedings of the seventh IEEE symposium on computers and communications 2002, ISCC’2002. Taormine, Italy; July 2002. p. 468–74. Pioro, 2004 Radunovic B, Le Boudec J-Y, A unified framework for max–min and min-max fairness with applications. Proceedings of 40th annual Allerton conference on communication control and computing. Allerton, IL; October 2002. Freund, 2000, Interior point methods: current status and future directions, 441 Freund RM, Roundy R, Todd MJ. Identifying the set of always-active constraints in a system of linear inequalities by a single linear program. Working paper 1674-85. Massachusetts Institute of Technology (MIT), Sloan School of Management; 1985. Bonald, 2001, Impact of fairness on Internet performance Charny, 1995, Congestion control with explicit rate indication Chiu, 1989, Analysis of the increase and decrease algorithms for congestion avoidance in computer networks, Computer Networks and ISDN Systems, 17, 1, 10.1016/0169-7552(89)90019-6 Kelly, 1998, Rate control in communication networks: shadow prices, proportional fairness and stability, Journal of the Operational Research Society, 49, 237, 10.1057/palgrave.jors.2600523 Massoulié, 1999, Bandwidth sharing: objectives and algorithms Fodor G, Malicsko G, Pioro M, Szymanski T. Path optimization for elastic traffic under fairness constraints. In Proceedings of ITC 2001. Boulahia-Oueslati S. Qualité de Service et Routage des Flots Élastiques dans un Réseau Multiservice. PhD thesis, ENST, Paris, France; November 2000. Chen, 1998, Maxmin fair routing in connection-oriented networks, 163 Nace D, Doan N-L. Some results on max–min fair routing. INOC 2003. Evry; 27–29 October 2003. In: Proceedings of INOC 2003. Evry; October 2003. Pioro M, Nilsson P, Kubilinskas E, Fodor G. On efficient max–min fair routing algorithms. In: Proceedings of ISCC 2003. Antalya, Turkey; July 2003. Ma Q. Quality-of-service routing in integrated service networks. PhD thesis, Carnegie Mellon University, Pittsburgh, USA; January 1998. Nace D, Doan LN, Gourdin E, Liau B. Computing optimal max–min fair resource allocation for elastic flows. In: IEEE transactions on networking; December 2006. Ford, 1962 Ahuja, 1993 Desaulniers G, Desrosiers J, Solomon MM, editors. Column generation. Springer, NY; June 2005. Georgiadis, 2001, Lexicographically optimal balanced networks, 689 Nace D, Klopfenstein O. On the lexicographically minimum loaded networks. In: Proceedings of INOC 2005. Lisbon, Portugal; March 2005. Ben Ameur, 2001, Routing strategies for IP networks, Telektronikk, 2/3, 145 Kleinrock, 1964