The impact of buffer finiteness on the loss rate in a priority queueing system

Authors:
Jeroen Van Velthoven;Benny Van Houdt;Chris Blondia
Affiliations:
University of Antwerp, Antwerpen, Belgium;University of Antwerp, Antwerpen, Belgium;University of Antwerp, Antwerpen, Belgium
Venue:
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Year:
2006

Citing 5
Cited 8

The Fourier-series method for inverting transforms of probability distributions

Queueing Systems: Theory and Applications - Numerical computations in queues
Discrete-time multiserver queues with priorities

Performance Evaluation
Asymptotics for M/G/1 low-priority waiting-time tail probabilities

Queueing Systems: Theory and Applications
Performance analysis of a single-server ATM queue with a priority scheduling

Computers and Operations Research
An Exact Solution for the State Probabilities of the Multi-Class, Multi-Server Queue with Preemptive Priorities

Queueing Systems: Theory and Applications

Mixed Finite-/Infinite-Capacity Priority Queue with Interclass Correlation

ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
Mixed Finite-/Infinite-Capacity Priority Queue with General Class-1 Service Times

ASMTA '09 Proceedings of the 16th International Conference on Analytical and Stochastic Modeling Techniques and Applications
Modelling queue sizes in an expedited forwarding DiffServ router with service differentiation

Proceedings of the 4th International Conference on Queueing Theory and Network Applications
Performance of a partially shared priority buffer with correlated arrivals

ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Time and space priority in a partially shared priority queue

Proceedings of the 5th International Conference on Queueing Theory and Network Applications
Packet loss minimization in load-balancing switch

ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
Triangular M/G/1-Type and Tree-Like Quasi-Birth-Death Markov Chains

INFORMS Journal on Computing
Performance analysis of priority queueing systems in discrete time

Network performance engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses five different ways to approximate the loss rate in a fundamental two class priority system, where each class has its own finite capacity buffer, as well as an exact approach. We identify the type of error one can expect by assuming that one, or both buffers are of infinite size. Furthermore, we investigate whether asymptotic based results can achieve the same level of accuracy as those based on the actual steady state probabilities. Three novel priority queueing models are introduced and efficient algorithms, relying on matrix analytic methods, are developed within this context. A comparative study based on numerical examples is also included