Robust dimensioning of proportionally fair networks
(2005) In European Transactions on Telecommunications 16(3). p.241-251- Abstract
- The notion of proportional fairness has recently gained considerable interest as a potential means for a fair allocation of bandwidth between the end nodes of demands in the networks carrying elastic traffic. The issue of proportionally fair allocation of bandwidth for the nominal state of the network has been studied before, both in the capacitated (link capacities given) and the uncapacitated (link capacities are also subject to optimisation) cases. In the presented paper, we address a more complicated uncapacitated problem - optimisation of link capacities for a proportionally fair network robust to failures. We formulate a relevant optimisation problem and propose efficient solution algorithms. Efficiency of the algorithms is... (More)
- The notion of proportional fairness has recently gained considerable interest as a potential means for a fair allocation of bandwidth between the end nodes of demands in the networks carrying elastic traffic. The issue of proportionally fair allocation of bandwidth for the nominal state of the network has been studied before, both in the capacitated (link capacities given) and the uncapacitated (link capacities are also subject to optimisation) cases. In the presented paper, we address a more complicated uncapacitated problem - optimisation of link capacities for a proportionally fair network robust to failures. We formulate a relevant optimisation problem and propose efficient solution algorithms. Efficiency of the algorithms is illustrated with numerical examples including large networks. The design approach is applicable to IP/MPLS networks based on leased transmission capacity. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/233869
- author
- Pioro, Michal LU ; Kubilinskas, Eligijus LU and Nilsson, Pål LU
- organization
- publishing date
- 2005
- type
- Contribution to journal
- publication status
- published
- subject
- in
- European Transactions on Telecommunications
- volume
- 16
- issue
- 3
- pages
- 241 - 251
- publisher
- John Wiley & Sons Inc.
- external identifiers
-
- wos:000230160400006
- scopus:21244437105
- ISSN
- 1541-8251
- DOI
- 10.1002/ett.1050
- language
- English
- LU publication?
- yes
- id
- 436d5556-a998-421d-9fbc-82a64b4663cd (old id 233869)
- date added to LUP
- 2016-04-01 11:42:01
- date last changed
- 2022-01-26 08:56:04
@article{436d5556-a998-421d-9fbc-82a64b4663cd, abstract = {{The notion of proportional fairness has recently gained considerable interest as a potential means for a fair allocation of bandwidth between the end nodes of demands in the networks carrying elastic traffic. The issue of proportionally fair allocation of bandwidth for the nominal state of the network has been studied before, both in the capacitated (link capacities given) and the uncapacitated (link capacities are also subject to optimisation) cases. In the presented paper, we address a more complicated uncapacitated problem - optimisation of link capacities for a proportionally fair network robust to failures. We formulate a relevant optimisation problem and propose efficient solution algorithms. Efficiency of the algorithms is illustrated with numerical examples including large networks. The design approach is applicable to IP/MPLS networks based on leased transmission capacity.}}, author = {{Pioro, Michal and Kubilinskas, Eligijus and Nilsson, Pål}}, issn = {{1541-8251}}, language = {{eng}}, number = {{3}}, pages = {{241--251}}, publisher = {{John Wiley & Sons Inc.}}, series = {{European Transactions on Telecommunications}}, title = {{Robust dimensioning of proportionally fair networks}}, url = {{http://dx.doi.org/10.1002/ett.1050}}, doi = {{10.1002/ett.1050}}, volume = {{16}}, year = {{2005}}, }