Network Calculus Meets Queueing Theory - A Simulation Based Approach to Bounded Queues
Key: PSS04-1
Author: Krishna Pandit, Jens Schmitt, Ralf Steinmetz
Date: June 2004
Kind: In proceedings
Book title: 2004 Twelfth IEEE International Workshop on Quality of Service (IWQoS'04), Montreal, Canada
Abstract: Quality of Service (QoS) is an area with high academic curiosity. Our long-term goal is to develop a unified mathematical model. This paper is a first step towards this ambitious goal. The most widespread models for network QoS are Network Calculus and Queueing Theory. While the strength of Queueing Theory is its proven applicability to a wide area of problems, Network Calculus can offer performance guarantees. We analyse by simulation the benefit of bringing the two of them together, i.e., bounding the stochastic processes of a queue with methods from Network Calculus. A basic result from Network Calculus is that enforcing traffic shaping and service curves bounds the buffer. This leads to denying buffer states in queues with infinite buffer. Specifically, we analyse what happens with the probability mass of such buffer states. Finally, we discuss how our results can be used for dimensioning buffers for multiplexed traffic.
View Full paper (PDF) | Download Full paper (PDF)

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.