Processor sharing queueing system with limited memory space

Abstract

Processor sharing queueing system is considered in which each customer has some random space requirement (volume), service time of the customer depends on his volume, and the total customers capacity in the system is limited by the value V (memory capacity). We find a stationary distribution of the number of customers in the system, as well as the stationary loss probability. Some particular cases are analyzed.