ALCOMFT-TR-03-12
|

|
Fabrice Guillemin, Philippe Robert and Bert Zwart
Tail Asymptotics for Processor Sharing Queues
INRIA.
Work package 2.
July 2003.
Abstract: The basic queueing system considered in this paper is the M/G/1 processor sharing (PS)
queue with or without impatience and with finite or infinite capacity. Under some mild
assumptions, a criterion for the validity of the RSR (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.
Postscript file: ALCOMFT-TR-03-12.ps.gz (209 kb).
System maintainer Gerth Stølting Brodal <gerth@cs.au.dk>