Support of fairness and guarantees without per-flow state in routers

Abstract

In this thesis, mechanisms that support minimum throughput guarantees and provide fair allocation of the remaining bandwidth without maintaining per flow state in core routers will be investigated. Mechanisms have been proposed to support flows with a minimum guaranteed rate and to distribute the remaining bandwidth fairly. These mechanisms usually require that each intermediate network node maintains some state for each flow passing through it and performs per-flow operations. This causes a scalability problem. Other mechanisms, that avoid the use of per-flow information and avoid per-flow processing in the interior of a network domain are now being proposed. Such mechanisms will be exposed and analysed

Date of Award	2001
Original language	English
Supervisor	Olivier Bonaventure (Supervisor)