Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue

We investigate the distribution of the waiting time V in a stable M/G/1 processor-sharing queue with traffic intensity ρ < 1. When the distribution of a customer service request B belongs to a large class of subexponential distributions with tails heavier than e^−√x, it is shown that