Fair routing and related optimization problems - invited talk
(2007) 15th International Conference on Advanced Computing and Communications ADCOM 2007- Abstract
- Routing of elastic traffic in the Internet should be fair in terms of bandwidth allocated to individual traffic demands. One fairness principle that can be applied is called max-min fairness (MMF) and requires that the worst bandwidth allocation is maximized and the solution is then extended with maximization of the second worst allocation, the third one, and so on. In this paper we discuss solution algorithms for basic MMF optimization problems related to fair routing in communications networks. Due to lexicographic maximization of ordered quantities, the MMF solution concept cannot be tackled by the standard optimization model, i.e., a mathematical programme. However, one can formulate a sequential lexicographic optimization procedure.... (More)
- Routing of elastic traffic in the Internet should be fair in terms of bandwidth allocated to individual traffic demands. One fairness principle that can be applied is called max-min fairness (MMF) and requires that the worst bandwidth allocation is maximized and the solution is then extended with maximization of the second worst allocation, the third one, and so on. In this paper we discuss solution algorithms for basic MMF optimization problems related to fair routing in communications networks. Due to lexicographic maximization of ordered quantities, the MMF solution concept cannot be tackled by the standard optimization model, i.e., a mathematical programme. However, one can formulate a sequential lexicographic optimization procedure. The basic procedure is applicable only for convex models, thus it allows to deal with relatively simple routing problems but fails if practical discrete restrictions commonly arising in the communications network context are to be taken into account. Then, however, alternative sequential approaches allowing to solve non-convex MMF problems can be used. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1024491
- author
- Pioro, Michal LU
- organization
- publishing date
- 2007
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- Internet, bandwidth allocation, convex programming, telecommunication network routing, telecommunication traffic
- host publication
- [Host publication title missing]
- pages
- 8 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- 15th International Conference on Advanced Computing and Communications ADCOM 2007
- conference location
- Guwahati, India
- conference dates
- 2007-12-18 - 2007-12-21
- ISBN
- 0-7695-3059-1
- DOI
- 10.1109/ADCOM.2007.121
- language
- English
- LU publication?
- yes
- id
- ed9abd7f-442b-4b5d-95fe-02ecf5543c6a (old id 1024491)
- date added to LUP
- 2016-04-04 11:00:08
- date last changed
- 2018-11-21 21:02:04
@inproceedings{ed9abd7f-442b-4b5d-95fe-02ecf5543c6a,
abstract = {{Routing of elastic traffic in the Internet should be fair in terms of bandwidth allocated to individual traffic demands. One fairness principle that can be applied is called max-min fairness (MMF) and requires that the worst bandwidth allocation is maximized and the solution is then extended with maximization of the second worst allocation, the third one, and so on. In this paper we discuss solution algorithms for basic MMF optimization problems related to fair routing in communications networks. Due to lexicographic maximization of ordered quantities, the MMF solution concept cannot be tackled by the standard optimization model, i.e., a mathematical programme. However, one can formulate a sequential lexicographic optimization procedure. The basic procedure is applicable only for convex models, thus it allows to deal with relatively simple routing problems but fails if practical discrete restrictions commonly arising in the communications network context are to be taken into account. Then, however, alternative sequential approaches allowing to solve non-convex MMF problems can be used.}},
author = {{Pioro, Michal}},
booktitle = {{[Host publication title missing]}},
isbn = {{0-7695-3059-1}},
keywords = {{Internet; bandwidth allocation; convex programming; telecommunication network routing; telecommunication traffic}},
language = {{eng}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
title = {{Fair routing and related optimization problems - invited talk}},
url = {{http://dx.doi.org/10.1109/ADCOM.2007.121}},
doi = {{10.1109/ADCOM.2007.121}},
year = {{2007}},
}