On the discrete‐time queue length distribution under markov‐dependent phases

The technique of probability generating functions has been applied to solve the steady state behavior of a discrete-time, single-channel, queueing problem wherein the arrivals to the queue at consecutive time-marks are statistically independent, but the service is accomplished in phases which are Markov-dependent. Special cases of importance have been discussed. In the end, mean number of phases, its special cases, the mean queue lengths, and the variances have been ascertained.