Meny

Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

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

Författare:
Publiceringsår: 2008
Språk: Engelska
Sidor: 5-17
Publikation/Tidskrift/Serie: IEEE Communications Surveys and Tutorials
Volym: 10
Nummer: 4
Dokumenttyp: Artikel

Sammanfattning

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.

Disputation

Nyckelord

  • Technology and Engineering

Övriga

Published
Yes
  • Networking
  • ISSN: 1553-877X

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen