Advanced

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

Dritan, Nace and Pioro, Michal LU (2008) In IEEE Communications Surveys and Tutorials 10(4). p.5-17
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.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
IEEE Communications Surveys and Tutorials
volume
10
issue
4
pages
5 - 17
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • wos:000207971900002
  • scopus:67349166529
ISSN
1553-877X
DOI
10.1109/SURV.2008.080403
language
English
LU publication?
yes
id
894cac2f-f372-4eff-81a6-aaed7535b479 (old id 1267365)
date added to LUP
2008-11-14 12:19:18
date last changed
2017-09-24 04:43:03
@article{894cac2f-f372-4eff-81a6-aaed7535b479,
  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.},
  author       = {Dritan, Nace and Pioro, Michal},
  issn         = {1553-877X},
  language     = {eng},
  number       = {4},
  pages        = {5--17},
  publisher    = {IEEE--Institute of Electrical and Electronics Engineers Inc.},
  series       = {IEEE Communications Surveys and Tutorials},
  title        = {Max-min fairness and its applications to routing and load-balancing in communication networks - a tutorial},
  url          = {http://dx.doi.org/10.1109/SURV.2008.080403},
  volume       = {10},
  year         = {2008},
}