Stationary characteristics of the $\mathrm{GI}/\mathrm{MSP}/n/\infty$ queue with general renovation

Consideration is given to the $\mathrm{GI}/\mathrm{MSP}/n/\infty$ queue with general input flow of customers, $n$ identical servers, service process of markovian type, queue of infinite capacity, and general renovation. General renovation being the variant of an active queue management mechanism, implies that upon a service completion, a customer may remove a random number of customers from the queue (if any is available), with a given probability distribution. Using embedded Markov chain technique, one derives stationary distributions of the main system's performance characteristics. The obtained results are ready for numerical implementation and allow one to compute stationary distributions of the system size, stationary loss probability, and waiting time distribution (under FIFO (first in, first out) service and head-of-the-queue renovation).