Priority Service of Primary Customers in the M/G/1/r Retrial Queueing System with Server Searching for Customers

In this paper a queueing system with a single customer searching server, retrials, finite buffer, Poisson flow and general distribution of service time is considered. An arriving customer joins a retrial orbit if he finds the buffer fully occupied. After finishing the service, the server searches for the next customer to be served among the customers in the buffer. The inter-retrial times are exponentially distributed with parameter. An orbiting customer can be served only if the buffer is free. A computational algorithm for stationary distribution of the primary queue length and a formula for the mean number of customers in the system are presented.