By Topic

Link capacity dimensioning and path optimization for networks supporting elastic services

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
G. Malicsko ; Ericsson Traffic Lab., Budapest, Hungary ; G. Fodor ; M. Pioro

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.

Published in:

Communications, 2002. ICC 2002. IEEE International Conference on  (Volume:4 )

Date of Conference:

2002