Processor Sharing Systems With Random Capacity Demands

Abstract

We discuss processor sharing queueing systems with non-homogeneous demands. This non-homogenity means that each demand (independently of others) has some random capacity and its length (or amount of work for its service) generally depends on the capacity. In real systems, a total sum of capacities of demands presenting in the system is limited by some constant value (memory volume) V > 0. But we estimate loss characteristcs for such system using queueing models with unlimited memory volume.