Advanced

Link capacity dimensioning and path optimization for networks supporting elastic services

Malicsko, Gabor; Fodor, Gabor and Pioro, Michal LU (2002) ICC - the IEEE International Conference on Communications, 2002 In IEEE ICC Proceedings p.2304-2311
Abstract
We consider the problem of link capacity dimensioning and routing optimization in networks that support elastic flows and maintain proportional fairness among these flows. We assume that each demand between the origin-destination (O-D) pairs is associated with a minimum and a maximum bandwidth requirement and that a certain allocated bandwidth to a user demand (which must be between these minimum and maximum values) generates revenue for the network operator. On the other hand, the operator is incurred a capacity dependent cost for each link in the network. We then formulate the problem of bandwidth allocation, routing optimization and link capacity dimensioning as an optimization problem where the operator's objective is to maximize... (More)
We consider the problem of link capacity dimensioning and routing optimization in networks that support elastic flows and maintain proportional fairness among these flows. We assume that each demand between the origin-destination (O-D) pairs is associated with a minimum and a maximum bandwidth requirement and that a certain allocated bandwidth to a user demand (which must be between these minimum and maximum values) generates revenue for the network operator. On the other hand, the operator is incurred a capacity dependent cost for each link in the network. We then formulate the problem of bandwidth allocation, routing optimization and link capacity dimensioning as an optimization problem where the operator's objective is to maximize profit (under the fairness constraint). We propose computationally efficient algorithms to solve some important variants of this problem. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
elastic traffic, IP networks, routing, max-min fairness
in
IEEE ICC Proceedings
pages
6 pages
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
ICC - the IEEE International Conference on Communications, 2002
external identifiers
  • Scopus:0036285408
ISBN
0-7803-7400-2
DOI
10.1109/ICC.2002.997257
language
English
LU publication?
yes
id
60e19aba-b187-40d7-b36f-b80515a327c3 (old id 959720)
date added to LUP
2008-01-30 14:28:24
date last changed
2016-10-13 04:38:11
@misc{60e19aba-b187-40d7-b36f-b80515a327c3,
  abstract     = {We consider the problem of link capacity dimensioning and routing optimization in networks that support elastic flows and maintain proportional fairness among these flows. We assume that each demand between the origin-destination (O-D) pairs is associated with a minimum and a maximum bandwidth requirement and that a certain allocated bandwidth to a user demand (which must be between these minimum and maximum values) generates revenue for the network operator. On the other hand, the operator is incurred a capacity dependent cost for each link in the network. We then formulate the problem of bandwidth allocation, routing optimization and link capacity dimensioning as an optimization problem where the operator's objective is to maximize profit (under the fairness constraint). We propose computationally efficient algorithms to solve some important variants of this problem.},
  author       = {Malicsko, Gabor and Fodor, Gabor and Pioro, Michal},
  isbn         = {0-7803-7400-2},
  keyword      = {elastic traffic,IP networks,routing,max-min fairness},
  language     = {eng},
  pages        = {2304--2311},
  publisher    = {ARRAY(0x969f788)},
  series       = {IEEE ICC Proceedings},
  title        = {Link capacity dimensioning and path optimization for networks supporting elastic services},
  url          = {http://dx.doi.org/10.1109/ICC.2002.997257},
  year         = {2002},
}