Per-flow Guarantees under Class-Based Priority Queueing
Key: SHHS03-1
Author: Jens Schmitt, Paul Hurley, Matthias Hollick, Ralf Steinmetz
Date: December 2003
Kind: In proceedings
Book title: Proceedings of IEEE Global Telecommunications Conference 2003 (GLOBECOM'03), San Francisco, CA, USA
Abstract: In this paper, we present an admission control scheme which provides per-flow delay and bandwidth guarantees based solely upon simple class-based strict priority queueing. We derive basic properties of the worst-case behaviour in strict priority queueing systems using network calculus. Building upon these properties the flow admission control scheme is devised. The rationale behind this work is the appealing simplicity as well as the almost ubiquitous availability of strict priority queueing in today’s routers and the thus promising applicability of our results for practical purposes in providing quality of service (QoS) in the Internet.

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, not withstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.