Queueing Systems with Random Volume Customers and their Performance Characteristics

In the paper, we consider non-classical queueing systems with non-homogeneous customers. The non-homogeneity we treat in the following sense: in systems under consideration, we characterize each customer by random capacity (volume) that can have an influence on his service time. We analyze a stochastic process having the sense of the total volume of all customers present in the system at given time instant. Such analysis for different queueing systems with unlimited or limited total volume can be used in designing of nodes of computer and communication networks while determining their buffer space capacity. We discuss basic problems of the theory of these systems and their performance characteristics. We also present some examples and results for systems with random volume customers.