Link capacity dimensioning and path optimization for networks supporting elastic services
(2002) ICC  the IEEE International Conference on Communications, 2002 In IEEE ICC Proceedings p.23042311 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 origindestination (OD) 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 origindestination (OD) 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:
http://lup.lub.lu.se/record/959720
 author
 Malicsko, Gabor; Fodor, Gabor and Pioro, Michal ^{LU}
 organization
 publishing date
 2002
 type
 Chapter in Book/Report/Conference proceeding
 publication status
 published
 subject
 keywords
 elastic traffic, IP networks, routing, maxmin fairness
 in
 IEEE ICC Proceedings
 pages
 6 pages
 publisher
 IEEEInstitute of Electrical and Electronics Engineers Inc.
 conference name
 ICC  the IEEE International Conference on Communications, 2002
 external identifiers

 Scopus:0036285408
 ISBN
 0780374002
 DOI
 10.1109/ICC.2002.997257
 language
 English
 LU publication?
 yes
 id
 60e19abab18740d7b36fb80515a327c3 (old id 959720)
 date added to LUP
 20080130 14:28:24
 date last changed
 20161013 04:38:11
@misc{60e19abab18740d7b36fb80515a327c3, 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 origindestination (OD) 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 = {0780374002}, keyword = {elastic traffic,IP networks,routing,maxmin fairness}, language = {eng}, pages = {23042311}, 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}, }