A finite $M\!AP_K/G_K/1$ queueing system with generalized foreground-background processor-sharing discipline

Queuing systems with Markov arrival process, several customer types, generalized foreground-background processor-sharing discipline with minimal served length or separate finite buffers for customers of different types, or a common finite buffer for customers of all types are studied. Mathematical relations are derived and used to compute the joint stationary distribution of the number of customers of all types in a system.

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