Meny

Javascript is not activated in your browser. This website needs javascript activated to work properly.
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: Performance Evaluation
Volym: 49
Nummer: 2002
Dokumenttyp: Artikel
Förlag: Elsevier Science B.V.

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 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.

Disputation

Nyckelord

  • Technology and Engineering
  • multi-commodity flows
  • proportional fairness
  • convex optimization
  • routing
  • elastic traffis

Övriga

Published
Yes
  • ISSN: 0166-5316

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