Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial

Authors:
D. Nace;M. Pioro
Affiliations:
Lab. Heudiasyc, Univ. de Technol. de Compiegne, Compiegne;-
Venue:
IEEE Communications Surveys & Tutorials
Year:
2008

Citing 0
Cited 7

Threshold configuration and routing optimization for PCN-based resilient admission control

Computer Networks: The International Journal of Computer and Telecommunications Networking
Scalable max-min fairness in wireless ad hoc networks

Ad Hoc Networks
Lexicographical minimization of routing hops in telecommunication networks

INOC'11 Proceedings of the 5th international conference on Network optimization
Combining Equity and Utilitarianism in a Mathematical Programming Model

Management Science
A novel approach for the performance bound of QoS-aware data networks under greedy CAC policy

Performance Evaluation
A hybrid column generation with GRASP and path relinking for the network load balancing problem

Computers and Operations Research
On max-min fair flow optimization in wireless mesh networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This tutorial is devoted to the notion of max-min fairness (MMF), associated optimization problems, and their applications to multi-commodity flow networks.We first introduce a theoretical background for a generic MMF optimization problem and discuss its relation to lexicographic optimization. We next present resolution algorithms for convex MMF optimization, and analyze their properties. In the second half of the tutorial we discuss its applications to communication networks, in particular to routing and load-balancing. We state several properties with respect to each of the studied problems and analyze the behavior of the algorithms.