A Single Server Retrial Queue with Impatient Customers

Abstract

In the present paper, a single server retrial queue with impatient customers is studied. The primary arrivals and repeating calls follow Poisson distribution. The service time is exponentially distributed. Explicit time dependent probabilities of exact number of arrivals and departures from the orbit are obtained by solving the differentialdifference equations recursively. Steady state solution of the number of busy servers is obtained. The numerical results are graphically displayed to illustrate the effect of arrival rate, retrial rate and service rate on different probabilities against time. Some special cases of interest are also deduced.