Solving dimensioning tasks for proportionally fair networks carrying elastic traffic

Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

Abstract

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.

Detaljer

Författare
  • Pål Nilsson
  • Michal Pioro
Enheter & grupper
Forskningsområden

Ämnesklassifikation (UKÄ) – OBLIGATORISK

  • Kommunikationssystem
  • Elektroteknik och elektronik

Nyckelord

Originalspråkengelska
Sidor (från-till)371-386
TidskriftPerformance Evaluation
Volym49
Utgivningsnummer2002
StatusPublished - 2002
PublikationskategoriForskning
Peer review utfördJa
Evenemang22nd IFIP Working Group 7.3 International Symposium on Computer Performance Modeling, Measurement and Evaluation. PERFORMANCE 2002 - Rome, Italien
Varaktighet: 2002 sep 232002 sep 27