Asymptotic regimes and approximations for discriminatory processor sharing

Authors:
Gijs van Kessel;Rudesindo Núñez-Queija;Sem Borst
Affiliations:
Eindhoven University of Technology, The Netherlands;Eindhoven University of Technology, The Netherlands;Eindhoven University of Technology, The Netherlands
Venue:
ACM SIGMETRICS Performance Evaluation Review
Year:
2004

Citing 3
Cited 9

The M/G/1 queue with processor sharing and its relation to a feedback queue

Queueing Systems: Theory and Applications
Time-shared Systems: a theoretical treatment

Journal of the ACM (JACM)
Sharing a Processor Among Many Job Classes

Journal of the ACM (JACM)

Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues

Performance Evaluation - Performance 2005
A survey on discriminatory processor sharing

Queueing Systems: Theory and Applications
Beyond processor sharing

ACM SIGMETRICS Performance Evaluation Review
On processor sharing and its applications to cellular data network provisioning

Performance Evaluation
Slowdown in the M/M/1 discriminatory processor-sharing queue

Performance Evaluation
Heavy-traffic analysis of the M/PH/1 discriminatory processor sharing queue with phase-dependent weights

ACM SIGMETRICS Performance Evaluation Review
Differential equation models of flow-size based priorities in internet routers

International Journal of Systems, Control and Communications
Discriminatory processor sharing queues with stationary ergodic service times and the performance of TCP in overload

Computer Networks: The International Journal of Computer and Telecommunications Networking
Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing

Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study the joint queue length distribution of the Discriminatory Processor Sharing model, assuming all classes have phase-type service requirement distributions. We show that the moments of the joint queue length distribution can be obtained by solving linear equations. We use this to study the system in two asymptotic regimes. In the first regime, the different user classes operate on strictly separated time scales. Then we study the system in heavy traffic.