Solving dimensioning tasks for proportionally fair networks carrying elastic traffic
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
Communication Systems, Electrical Engineering, Electronic Engineering, Information Engineering, multi-commodity flows, proportional fairness, convex optimization, routing, elastic traffis
Publisher: 'Elsevier BV'
DOI identifier: 10.1016/S0166-5316(02)00114-1
Sorry, we are unable to provide the full text but you may find it at the