The N/G/1 queue and its detailed analysis

Abstract

We discuss a single-server queue whose input is the versatile Markovian point process recently introduced by Neuts [22] herein to be called the N-process. Special cases of the N-process discussed earlier in the literature include a number of complex models such as the Markov-modulated Poisson process, the superposition of a Poisson process and a phase-type renewal process, etc. This queueing model has great appeal in its applicability to real world situations especially such as those involving inhibition or stimulation of arrivals by certain renewals. The paper presents formulas in forms which are computationally tractable and provides a unified treatment of many models which were discussed earlier by several authors and which turn out to be special cases. Among the topics discussed are busy-period characteristics, queue-length distributions, moments of the queue length and virtual waiting time. We draw particular attention to our generalization of the Pollaczek–Khinchin formula for the Laplace–Stieltjes transform of the virtual waiting time of the M/G/1 queue to the present model and the resulting Volterra system of integral equations. The analysis presented here serves as an example of the power of Markov renewal theory.