Some Explicit Formulas for the Steady-State Behavior of the Queue with Semi-Markovian Service Times.
PURDUE UNIV LAFAYETTE IND DEPT OF STATISTICS
Pagination or Media Count:
This paper discusses a number of explicity formulas for the steady-state features of the queue with Poisson arrivals in groups of random sizes and semi-Markovian service times. Computationally useful formulas for the expected duration of the various busy periods, for the mean numbers of customers served during them, as well as for the lower order moments of the queue lengths, both in discrete and in continuous time, and of the virtual waiting time are obtained. The formulas are recursive matrix expressions, which generalize the analogous but much simpler results for the classical MG1 model. Author
- Statistics and Probability