Solving dimensioning tasks for proportionally fair networks carrying elastic traffic

Research output: Contribution to journalArticle


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.


Research areas and keywords

Subject classification (UKÄ) – MANDATORY

  • Communication Systems
  • Electrical Engineering, Electronic Engineering, Information Engineering


  • multi-commodity flows, proportional fairness, convex optimization, routing, elastic traffis
Original languageEnglish
Pages (from-to)371-386
JournalPerformance Evaluation
Issue number2002
Publication statusPublished - 2002
Publication categoryResearch
Event22nd IFIP Working Group 7.3 International Symposium on Computer Performance Modeling, Measurement and Evaluation. PERFORMANCE 2002 - Rome, Italy
Duration: 2002 Sep 232002 Sep 27