An arrival time approach to M/G/I-type queues with generalized vacations

摘要

We propose a simple way, called the arrival time approach, of finding the queue length distributions for M/G/ 1 -type queues with generalized server vacations. The proposed approach serves as a useful alternative to understanding complicated queueing processes such as priority queues with server vacations and MAP/G/ 1 queues with server vacations.