On Adaptive Bandwidth Sharing with Rate Guarantees

The objective of recent research in fair queueing schemes has been to efficiently emulate a fluid-flow generalized (weighted) processor sharing (GPS) system, as closely as possible. A primary motivation for the use of fair-queueing has been its use as a means of providing bandwidth guarantees and as a consequence end-to-end delay bounds for traffic with bounded burstiness. The rate guarantees translate to scheduling weights which are set when admission control is done. A consequence of fair queueing systems closely emulating GPS is that when one or more connections are not backlogged, any "excess" bandwidth is distributed to backlogged connections in proportion to their weights. However, weights are set based on the longterm requirements of traffic flows and not in any state-dependent manner that reflects instantaneous needs. In this paper, we question the notion that queueing systems should closely emulate a GPS system. Instead of emulating GPS, we propose three modified sc...

• Type: Conference
• Year: 1998
• Where: INFOCOM
• Authors: Nick G. Duffield, T. V. Lakshman, Dimitrios Stiliadis
• Keywords: Communications, Delay Bounds, Fair Queueing, Fair Queueing Schemes, INFOCOM 1998