Solving dimensioning tasks for proportionally fair networks carrying elastic traffic

Authors:
Pål Nilsson;Michal Pióro
Affiliations:
Department of Communication Systems, Lund University, P.O. Box 118, SE-22100 Lund, Sweden;Institute of Telecommunications, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland
Venue:
Performance Evaluation
Year:
2002

Citing 1
Cited 2

Data networks

Data networks

A framework for resource dimensioning in GPON access networks

International Journal of Network Management
On max-min fair flow optimization in wireless mesh networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

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.