Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Solving dimensioning tasks for proportionally fair networks carrying elastic traffic

In English

Författare

  • Pål Nilsson
  • Michal Pioro

Summary, in English

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.

Publiceringsår

2002

Språk

Engelska

Sidor

371-386

Publikation/Tidskrift/Serie

Performance Evaluation

Volym

49

Issue

2002

Dokumenttyp

Artikel i tidskrift

Förlag

Elsevier

Ämne

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

Nyckelord

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

Conference name

22nd IFIP Working Group 7.3 International Symposium on Computer Performance Modeling, Measurement and Evaluation. PERFORMANCE 2002

Conference date

2002-09-23 - 2002-09-27

Conference place

Rome, Italy

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 0166-5316