The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Solving dimensioning tasks for proportionally fair networks carrying elastic traffic

På svenska

Author

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

Publishing year

2002

Language

English

Pages

371-386

Publication/Series

Performance Evaluation

Volume

49

Issue

2002

Document type

Journal article

Publisher

Elsevier

Topic

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

Keywords

  • 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/Other

  • ISSN: 0166-5316