Provable bounds for the mean queue lengths in a heterogeneous priority queue

Authors:
H. Leemans
Affiliations:
-
Venue:
Queueing Systems: Theory and Applications
Year:
2000

Citing 0
Cited 2

Tail Decay Rates in Double QBD Processes and Related Reflected Random Walks

Mathematics of Operations Research
Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.