Approximation in the M2/G2/1 Queue with Preemptive Priority
The main purpose of this paper is to use the strong stability method to approximate the characteristics of the M2/G2/1 queue with preemptive priority by those of the classical M/G/1 queue. The latter is simpler and more exploitable in practice. After perturbing the arrival intensity of the priority requests, we derive the stability conditions and next obtain the stability inequalities with an exact computation of constants. From those theoretical results, we elaborate an algorithm allowing us to verify the approximation conditions and to provide the made numerical error. In order to have an idea about the efficiency of this approach, we consider a concrete example whose results are compared with those obtained by simulation.
KeywordsPreemptive queue Markov chain Strong stability Perturbation Simulation
AMS 2000 Subject Classification60K25 60J25
Unable to display preview. Download preview PDF.
- Aïssani D, Kartashov NV (1983) Ergodicity and stability of Markov chains with respect to operator topology in the space of transition kernels. Dokl Akad Nauk Ukr SSR Ser A 11:3–5Google Scholar
- Stoyan D, Daley DJ (1984) Comparison methods for queues and other stochastic models. Wiley, New YorkGoogle Scholar