Analysis of a finite queue with a Markov input flow, depending on the state of the system, and arbitrary servicing

Summary (translated from the Russian): "We consider a single-server queueing system with a finite-capacity accumulator in which a Markov flow of customers arrives. We assume that the matrix parameters determining the Markov flow depend on the number of customers in the system. The customer service times are distributed according to an arbitrary law. We obtain a matrix algorithm for computing the stationary state probabilities of the system and derive relations for a number of its performance indices."