Stationary distribution of a queue in a finite-capacity queueing system with group arrival and queueing time of phase type

Summary (translated from the Russian): "We consider a queueing system of GI/GI/1/r type with group arrival and with distribution functions for the arrival and service times of phase type. The group size is random, but limited by the system's capacity. If the number of customers in the arrival group is greater than the number of free servers, then the remaining customers are lost. We obtain a matrix-recurrent algorithm for computing the stationary distribution of the number of customers in the system as well as the Laplace-Stieltjes transform of the stationary waiting time distribution."