Du är här

Solving dimensioning tasks for proportionally fair networks carrying elastic traffic

Författare:
Publiceringsår: 2002
Språk: Engelska
Sidor: 371-386
Publikation/Tidskrift/Serie: Proceedings 22nd IFIP Working Group 7.3 International Symposium on Computer Performance Modeling, Measurement and Evaluation. PERFORMANCE 2002
Volym: 49
Dokumenttyp: Konferensbidrag

Sammanfattning

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 ptimisation theory, and illustrate them with numerical examples. The explicit solutions can guide a network operator how to proceed when introducing PF into his network.

Disputation

Nyckelord

  • Technology and Engineering
  • multicommodity flows
  • network optimisation
  • elastic traffic
  • fairness

Övriga

22nd IFIP Working Group 7.3 International Symposium on Computer Performance Modeling, Measurement and Evaluation. PERFORMANCE 2002
23-27 Sept. 2002
Rome, Italy
Published
Yes

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

LERU logotype U21 logotype

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