Tail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements

Abstract

We derive the sojourn time asymptotics for a multi-class G/G/1 queue with regularly varying service requirements operating under the Discriminatory ProcessorSharing (DPS) discipline. DPS provides a natural approach for modelling the flowlevel performance of differentiated bandwidth-sharing mechanisms. Under certain assumptions, we prove that the service requirement and sojourn time of a given class have similar tail behaviour, independent of the specific values of the DPS weights. As a by-product, we obtain an extension of the tail equivalence for ordinary ProcessorSharing (PS) queues to non-Poisson arrivals. The results suggest that DPS offers a potential instrument for effectuating preferential treatment to high-priority classes, without inflicting excessive delays on low-priority classes. To obtain the asymptotics, we develop a novel method which only involves information of the workload process and does not require any knowledge of the steady-state queue length distribution. In particular, the proof method brings sufficient strength to extend the results to scenarios with a time-varing service capacity.

DOI: 10.1016/j.peva.2004.11.010

Extracted Key Phrases

Cite this paper

@article{Borst2005TailAF, title={Tail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements}, author={Sem C. Borst and Dennis van Ooteghem and Bert Zwart}, journal={Perform. Eval.}, year={2005}, volume={61}, pages={281-298} }