Generalized Erlang problem for queueing systems with accumulation

Abstract

We consider a non-classical $M/G/n/0$ type queueing system with random volume demands. Each demand requires $m$ servers for its simultaneous service with probability $q_m, Σ^n_{m=1} q_m = 1$. Service time of the demand depends on the demand volume and $m$. The total volume of demands presenting in the system is restricted by memory volume V. For such system the stationary distribution of demands number and loss probability are determined.