Analysis of a single-server retrial queue with quasi-random input and nonpreemptive priority

Abstract

In this paper, we model a single-server retrial queue with quasi-random input and two priority classes. In the case of blocking, a high priority unit is queued, whereas a low priority unit joins the orbit to start generating a Poisson flow of repeated attempts until it finds the server free. Since units in orbit will be served only when the high priority queue is empty, high priority units have nonpreemptive priority over low priority units. We present a simple analysis for the outside observer distribution of the system state as well as for the arriving unit distribution in steady state. Besides, we give numerical examples to illustrate the effect of the parameters on several performance characteristics.