General approach to determining the basic characteristics of queueing systems with finite total capacity

We discuss a general view of solutions for characteristics of non-classical queueing systems with random capacity customers (demands), i.e. we suppose that each customer is characterized by some random capacity (volume) and the whole capacity (total volume) of customers present in the queueing system is bounded by a constant value V > 0. We determine the general view of the stationary number distribution and loss probability in the systems under consideration as compared with corresponding classical queueing systems. It's turned that in some cases we can write expressions for non-classical characteristics of finite total capacity queues if corresponding classical characteristics are known.