Advanced

Solving dimensioning tasks for proportionally fair networks carrying elastic traffic

Nilsson, Pål LU and Pioro, Michal LU (2002) 22nd IFIP Working Group 7.3 International Symposium on Computer Performance Modeling, Measurement and Evaluation. PERFORMANCE 2002 In Performance Evaluation 49(2002). p.371-386
Abstract
The paper studies optimal dimensioning problems associated with the notion of “proportional fairness” (PF) considered for packet networks carrying elastic (greedy) traffic, i.e. the traffic streams that can use up, perhaps within certain assumed bounds, any bandwidth that is assigned to them. We give effective, simple and explicit solutions to the introduced optimisation tasks based on the dual optimisation theory, and illustrate them with numerical examples. The explicit solutions can guide a network operator how to proceed when introducing PF into his network.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
multi-commodity flows, proportional fairness, convex optimization, routing, elastic traffis
in
Performance Evaluation
volume
49
issue
2002
pages
371 - 386
publisher
Elsevier
conference name
22nd IFIP Working Group 7.3 International Symposium on Computer Performance Modeling, Measurement and Evaluation. PERFORMANCE 2002
external identifiers
  • scopus:12144288165
  • wos:000178165600025
ISSN
0166-5316
DOI
10.1016/S0166-5316(02)00114-1
language
English
LU publication?
yes
id
b0584e3a-a3b8-47df-858e-d871bc021978 (old id 960915)
date added to LUP
2008-01-30 14:45:26
date last changed
2017-01-01 04:37:25
@article{b0584e3a-a3b8-47df-858e-d871bc021978,
  abstract     = {The paper studies optimal dimensioning problems associated with the notion of “proportional fairness” (PF) considered for packet networks carrying elastic (greedy) traffic, i.e. the traffic streams that can use up, perhaps within certain assumed bounds, any bandwidth that is assigned to them. We give effective, simple and explicit solutions to the introduced optimisation tasks based on the dual optimisation theory, and illustrate them with numerical examples. The explicit solutions can guide a network operator how to proceed when introducing PF into his network.},
  author       = {Nilsson, Pål and Pioro, Michal},
  issn         = {0166-5316},
  keyword      = {multi-commodity flows,proportional fairness,convex optimization,routing,elastic traffis},
  language     = {eng},
  number       = {2002},
  pages        = {371--386},
  publisher    = {Elsevier},
  series       = {Performance Evaluation},
  title        = {Solving dimensioning tasks for proportionally fair networks carrying elastic traffic},
  url          = {http://dx.doi.org/10.1016/S0166-5316(02)00114-1},
  volume       = {49},
  year         = {2002},
}