Skip to Main content Skip to Navigation
Reports

Asymptotic behavior of Generalized Processor Sharing queues under subexponential hypothesis

Marc Lelarge 1
1 TREC - Theory of networks and communications
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt
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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00072249
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 8:13:30 PM
Last modification on : Tuesday, September 22, 2020 - 3:58:36 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:00:34 PM

Identifiers

  • HAL Id : inria-00072249, version 1

Collections

Citation

Marc Lelarge. Asymptotic behavior of Generalized Processor Sharing queues under subexponential hypothesis. [Research Report] RR-4339, INRIA. 2001. ⟨inria-00072249⟩

Share

Metrics

Record views

216

Files downloads

199