Asymptotic regimes and approximations for discriminatory processor sharing

0211 other engineering and technologies 0102 computer and information sciences 02 engineering and technology 01 natural sciences
DOI: 10.1145/1035334.1035352 Publication Date: 2007-01-17T18:32:02Z
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.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (10)
CITATIONS (15)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....