Throughputs in processor sharing models for integrated stream and elastic traffic

摘要: We present an analytical study of throughput measures in processor sharing queuing systems with randomly varying service rates, modelling e.g. a communication link integrated services network carrying prioritised fixed rate stream traffic and rate-adaptive elastic traffic. A number distinct for the are defined, analysed compared under various system conditions, both by means simulation. It is concluded that call-average throughput, which most relevant from user point view but typically hard to analyse, very well approximated newly proposed so-called expected instantaneous readily obtained system's steady state distribution.