Stochastic modelling and analysis: a computational approach
Stochastic modelling and analysis: a computational approach
Processor-sharing queues: some progress in analysis
Queueing Systems: Theory and Applications
On the self-similar nature of Ethernet traffic
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Waiting Time Distributions for Processor-Sharing Systems
Journal of the ACM (JACM)
Downlink scheduling in CDMA data networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Sojourn times in a processor sharing queue with service interruptions
Queueing Systems: Theory and Applications
Sojourn time asymptotics in the M/G/1 processor sharing queue
Queueing Systems: Theory and Applications
Integrated Admission Control for Streaming and Elastic Traffic
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
HSDPA flow level performance: the impact of key system and traffic aspects
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Queueing Systems: Theory and Applications
Optimal robust policies for bandwidth allocation and admission control in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Queuing system with processor sharing and limited resources
Automation and Remote Control
Hi-index | 0.00 |
We present an analytical study of throughput measures in processor sharing queuing systems with randomly varying service rates, modelling e.g. a communication link in an integrated services network carrying prioritised fixed rate stream traffic and rate-adaptive elastic traffic. A number of distinct throughput measures for the elastic traffic are defined, analysed and compared under various system conditions, both by analytical means and simulation. 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 is readily obtained from the system's steady state distribution.