A single-server finite-capacity queueing system with Markov flow and discrete-time service

Concepts of a discrete Markov flow and discrete-time Markov service are defined. A single-server finite-capacity queueing system with Markov flow and discrete-time service is studied. An algorithm for computing the stationary state probability distribution of the system is designed. The main performance characteristics, such as the stationary loss probability and mean waiting time for service, are determined.

Presented by the member of Editorial Board: V. M. Vishnevsky