Chae et al. (2001) proposed a simple approach, called the arrival time approach, of finding the queue length distribution for M/G/1-type queues with generalized server vacations. The proposed approach serves as a useful alternative to understanding co...
Chae et al. (2001) proposed a simple approach, called the arrival time approach, of finding the queue length distribution for M/G/1-type queues with generalized server vacations. The proposed approach serves as a useful alternative to understanding complicated queueing processes. Recently, there have been several studies on some M/G/1 retrial queues with general retrial times, in which the retrial time has a general distribution and only the first customer in the retrial queue is allowed to try to enter the service area. Most of the studies employ the supplementary variable technique to obtain the queue length distributions. In this paper, we present that the arrival time approach is a simple and straightforward alternative to obtain the queue length distribution for M/G/1 retrial queues with general retrial times.