The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

På svenska

Author

  • Nace Dritan
  • Michal Pioro

Summary, in English

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.

Publishing year

2008

Language

English

Pages

5-17

Publication/Series

IEEE Communications Surveys and Tutorials

Volume

10

Issue

4

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Status

Published

Research group

  • Networking

ISBN/ISSN/Other

  • ISSN: 1553-877X