Two-Class Priority Queueing System with State-Dependent Arrivals

In this paper, we present a performance analysis of a 2-dimensional preemptive priority queueing system with state-dependent arrivals. Using a Markovian formulation we first compute the steady state distribution for the queue length of both classes. Then, waiting times and busy periods are characterized through (i) first and second moments and (ii) the approximation of their cumulative distribution functions (cdf) and Laplace–Stieltjes transforms (LST). We derive these approximations connecting bounds in the Laplace domain with bounds on the original time domain. We also, study the behavior of the inter-departure time for each class. Finally, we conclude the paper with a set of computational experiments testing our results.