Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Link capacity dimensioning and path optimization for networks supporting elastic services

Publiceringsår: 2002
Språk: Engelska
Sidor: 2304-2311
Publikation/Tidskrift/Serie: IEEE ICC Proceedings
Dokumenttyp: Konferensbidrag
Förlag: IEEE--Institute of Electrical and Electronics Engineers Inc.


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.


  • Electrical Engineering, Electronic Engineering, Information Engineering
  • Communication Systems
  • elastic traffic
  • IP networks
  • routing
  • max-min fairness


ICC - the IEEE International Conference on Communications, 2002
  • ISBN: 0-7803-7400-2

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen