Performance analysis of a discrete-time Geo/G/1 retrial queue with non-preemptive priority, working vacations and vacation interruption

Abstract

This paper is concerned with a discrete-time Geo=G=1 retrial queueing system with non-preemptive priority, working vacations and vacation interruption where the service times and retrial times are arbitrarily distributed. If an arriving customer finds the server free, his service commences immediately. Otherwise, he either joins the priority queue with probability α, or leaves the service area and enters the retrial group (orbit) with probability α (= 1 - α). Customers in the priority queue have non-preemptive priority over those in the orbit. Whenever the system becomes empty, the server takes working vacation during which the server can serve customers at a lower service rate. If there are customers in the system at the epoch of a service completion, the server resumes the normal working level whether the working vacation ends or not (i.e., working vacation interruption occurs). Otherwise, the server proceeds with the vacation. Employing supplementary variable method and generating function technique, we analyze the underlying Markov chain of the considered queueing model, and obtain the stationary distribution of the Markov chain, the generating functions for the number of customers in the priority queue, in the orbit and in the system, as well as some crucial performance measures in steady state. Furthermore, the relation between our discrete-time queue and its continuous-time counterpart is investigated. Finally, some numerical examples are provided to explore the effect of various system parameters on the queueing characteristics.