Analysis of the queueing system MAP_2/G_2/1/r with absolute priority
Summary (translated from the Russian): "We study a single-server queueing system with a common buffer of limited capacity. Two Markov customer streams arrive into the system. Their service times have arbitrary distribution functions that are different for each customer type. Customers of the first type have absolute priority, and a customer whose service is interrupted is served anew. We derive a matrix algorithm for computing the stationary probabilities of the system states, both at arbitrary moments of time and at arrival or service completion times."