Tail asymptotics for processor-sharing queues
- 1 June 2004
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 36 (2) , 525-543
- https://doi.org/10.1239/aap/1086957584
Abstract
The basic queueing system considered in this paper is the M/G/1 processor-sharing queue with or without impatience and with finite or infinite capacity. Under some mild assumptions, a criterion for the validity of the reduced-service-rate approximation is established when service times are heavy tailed. This result is applied to various models based on M/G/1 processor-sharing queues.Keywords
This publication has 15 references indexed in Scilit:
- Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing QueueMathematics of Operations Research, 2003
- Insensitivity in processor-sharing networksPerformance Evaluation, 2002
- Tail Asymptotics for the Busy Period in the GI/G/1 QueueMathematics of Operations Research, 2001
- The Busy Period of the M/GI/∞ QueueQueueing Systems, 2001
- Sojourn time asymptotics in the M/G/1 processor sharing queueQueueing Systems, 2000
- Sampling at subexponential times, with queueing applicationsStochastic Processes and their Applications, 1999
- Activity periods of an infinite server queue and performance of certain heavy tailed fluid queuesQueueing Systems, 1999
- Processor-shared buffers with renegingPerformance Evaluation, 1994
- Insensitivity in queueing systemsAdvances in Applied Probability, 1981
- Networks of queuesAdvances in Applied Probability, 1976