A Priority Retrial Queue with Constant Retrial Policy

Abstract

We analyse a priority queueing system with a normal queue (high priority) and an orbit (low priority). Only the first customer in orbit can retry during times that the queue and server are empty (constant retrial policy). In contrast with existing literature, we assume different service time distributions for the high- and low-priority customers. We obtain closed-form expressions for the probability generating function of the number of customers in queue and orbit, in steady state, and for the Laplace Stieltjes transforms of the stationary waiting times of both type of customers.