A finite queue with a markov input dependent on the state of the system and a random service discipline

A single-server finite-capacity queue with a Markov input is studied under the assumption that the matrix parameters determining the Markov flow depend on the number of calls in the system. The service time is distributed by an arbitrary law. A matrix algorithm for computing the stationary probabilities of the states and expressions interrelating the capacity parameters of the system are derived.