Asymptotic behavior of Generalized Processor Sharing queues under subexponential hypothesis
Abstract
We analyze the behavior of Generalized Processor Sharing (GPS) queues with heavy tailed service times. The model consists of coupled queues : each one receives an arrival stream of customers with inter-arrival time that are i.i.d and with service times that are subexponential. We calculate the exact stationary workload asymptotic of an individual flow for this model.