Throughputs in processor sharing models for integrated stream and elastic traffic

We present an analytical study of throughput measures in processor sharing queueing systems with randomly varying service rates, modelling a communication link in an integrated services network carrying prioritised stream traffic and elastic traffic. A number of distinct throughput measures for the elastic traffic are defined and analysed. In particular, the differences between the various throughput measures and the impact of the elastic call size distribution are investigated. It is concluded that the call-average throughput, which is most relevant from the user point of view but typically hard to analyse, is very well approximated by the newly proposed so-called expected instantaneous throughput, which can easily be obtained from the system's steady state distribution. \u