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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Abate, J., Whitt, W.: The Fourier-series method for inverting transforms of probability distributions. Queueing Systems 10, 5–88 (1992)
Abate, J., Whitt, W.: Asymptotics for M/G/1 low-priority waiting-time tail probabilities. Queueing Systems 25, 173–233 (1997)
Alfa, A.S.: Matrix-geometric solution of discrete time MAP/PH/1 priority queue. Naval Research Logistics 45, 23–50 (1998)
Alfa, A.S., Liu, B., He, Q.M.: Discrete-time analysis of MAP/PH/1 multiclass general preemptive priority queue. Naval Research Logistics 50, 662–682 (2003)
Falkenberg, E.: On the asymptotic behaviour of the stationary distribution of Markov chains of M/G/1-type. Stochastic Models 10(1), 75–97 (1994)
György, A., Borsos, T.: Estimates on the packet loss ratio via queue tail probabilities. In: IEEE Globecom, San Antonio, TX, USA (November 2001)
Ishizaki, F.: Numerical method for discrete-time finite-buffer queues with some regenerative structure. Stochastic Models 18(1), 25–39 (2002)
Sapna Isotupa, K.P., Stanford, D.A.: An infinite-phase quasi-birth-and-death model for the non-preemptive priority M/PH/1 queue. Stochastic Models 18(3), 387–424 (2002)
Kim, N.K., Chaudry, M.L.: Numerical inversion of generating functions: a computational experience (manuscript, 2005)
Laevens, K., Bruneel, H.: Discrete-time multiserver queues with priorities. Performance Evaluation 33(4), 249–275 (1998)
Meini, B.: An improved FFT-based version of Ramaswami’s formula. Stochastic Models 13, 223–238 (1997)
Neuts, M.F.: Structured Stochastic Matrices of M/G/1 type and their applications. Marcel Dekker, Inc., New York (1989)
Ramaswami, V.: A stable recursion for the steady state vector in Markov chains of M/G/1 type. Commun. Statist.-Stochastic Models 4, 183–188 (1988)
Sleptchenko, A., van Harten, A., van der Heijden, M.C.: An exact analysis of the multi-class M/M/k priority queue with partial blocking. Stochastic Models 19(4), 527–548 (2003)
Sleptchenko, A., van Harten, A., van der Heijden, M.C.: An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities. Queueing Systems 50(1), 81–107 (2005)
Walraevens, J., Steyaert, B., Bruneel, H.: Performance analysis of a single-server ATM queue with a priority scheduling. Computers & Operations Research 30(12), 1807–1829 (2003)
Walraevens, J., Steyaert, B., Bruneel, H.: A packet switch with a priority scheduling discipline: Performance analysis. Telecommunication Systems 28(1), 53–77 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Van Velthoven, J., Van Houdt, B., Blondia, C. (2006). The Impact of Buffer Finiteness on the Loss Rate in a Priority Queueing System. In: Horváth, A., Telek, M. (eds) Formal Methods and Stochastic Models for Performance Evaluation. EPEW 2006. Lecture Notes in Computer Science, vol 4054. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11777830_15
Download citation
DOI: https://doi.org/10.1007/11777830_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35362-1
Online ISBN: 978-3-540-35365-2
eBook Packages: Computer ScienceComputer Science (R0)