Computing Optimal Max-Min Fair Resource Allocation for Elastic Flows

In this paper, we consider the max-min fair resource allocation problem as applied to elastic flows. We are interested in computing the optimal max-min fair rate allocation. The proposed approach is a linear programming based one and allows the computation of optimal routing paths with regard to max-min fairness, in stable and known traffic conditions. We consider non-bounded access rates, but we show how the proposed approach can handle the case of upper-bounded access rates. A proof of optimality and some computational results are also presented

[1]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 2002, TNET.

[2]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[3]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[4]  Jerome Galtier.  Semi - Definite Programming as a Simple Extension to Linear Programming: Convex Optimization with Qu , 2001 .

[5]  Sara Oueslati Boulamia.  Qualite de service et routage des flots elastiques dans un reseau multiservice , 2000 .

[6]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[7]  Dritan Nace,et al.  A linear programming based approach for computing optimal fair splittable routing , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[8]  Walid Ben-Ameur,et al.  Internet Routing and Related Topology Issues , 2003, SIAM J. Discret. Math..

[9]  Wei K. Tsai,et al.  A THEORY OF MAXMIN RATE ALLOCATION WITH MINIMAL RATE GUARANTEE , 2000 .

[10]  Michal Pióro,et al.  On efficient max-min fair routing algorithms , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[11]  Jean-Yves Le Boudec,et al.  Rate adaptation, Congestion Control and Fairness: A Tutorial , 2000 .

[12]  Klara Nahrstedt,et al.  Maxmin Fair Routing in Connection-Oriented Networks , 1998 .

[13]  Ashish Goel,et al.  Combining fairness with throughput: online routing with multiple objectives , 2000, STOC '00.

[14]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[15]  Raj Jain,et al.  Congestion control with explicit rate indication , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[16]  Laurent Massoulié,et al.  Impact of fairness on Internet performance , 2001, SIGMETRICS '01.

[17]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[18]  Qingming Ma.  Quality-of-Service Routing in Integrated Services Networks , 1998 .

[19]  P. Georgatsos,et al.  Lexicographically optimal balanced networks , 2002, IEEE/ACM Trans. Netw..

[20]  Dritan Nace,et al.  Max-min fairness in multi-commodity flows , 2008, Comput. Oper. Res..

[21]  Jean-Yves Le Boudec,et al.  A unified framework for max-min and min-max fairness with applications , 2007, TNET.