| Abstract: | The M X /G/1 queueing system as well as several of its variants have long ago been studied by considering the embedded discrete-time Markov chain at service completion epochs. Alternatively other approaches have been proposed such as the theory of regenerative processes, the supplementary variable method, properties of the busy period, etc. In this note we study the M X /G/1 queue via a simple new method that uses renewal arguments. This approach seems quite powerful and may become fruitful in the investigation of other queueing systems as well. |
