Abstract
We analyze a two-class two-server system with nonpreemptive heterogeneous priority structures. We use matrix–geometric techniques to determine the stationary queue length distributions. Numerical solution of the matrix–geometric model requires that the number of phases be truncated and it is shown how this affects the accuracy of the results. We then establish and prove upper and lower bounds for the mean queue lengths under the assumption that the classes have equal mean service times.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Çinlar, Introduction to Stochastic Processes (Prentice-Hall, Englewood Cliffs, NJ, 1975).
G. Latouche and V. Ramaswami, A logarithmic reduction algorithm for quasi-birth-death processes, J. Appl. Probab. 30 (1993) 650–674.
H. Leemans, The two-class two-server queueing model with nonpreemptive heterogeneous priority structures, Ph.D. thesis, Department of Applied Economic Sciences, K.U. Leuven (1998).
M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models. An Algorithmic Approach (Johns Hopkins Univ. Press, Baltimore, MD, 1981).
OS/390 V2R4.0 JES2 Introduction, IBM, GC28-1794-02 (1998).
G.J. van Houtum, New approaches for multi-dimensional queueing systems, Ph.D. thesis, Technische Universiteit Eindhoven (1995).
G.J. van Houtum, W.H.M. Zijm, I.J.B.F. Adan and J. Wessels, Bounds for performance characteristics; a systematic approach via cost structures, Commun. Statist. Stochastic Models 14 (1998) 205–224.
Rights and permissions
About this article
Cite this article
Leemans, H. Provable bounds for the mean queue lengths in a heterogeneous priority queue. Queueing Systems 36, 269–286 (2000). https://doi.org/10.1023/A:1019187320989
Issue Date:
DOI: https://doi.org/10.1023/A:1019187320989