Asymptotic behavior of Generalized Processor Sharing queues under subexponential hypothesis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

Asymptotic behavior of Generalized Processor Sharing queues under subexponential hypothesis

Marc Lelarge
  • Function : Author
  • PersonId : 833445

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.
Fichier principal
Vignette du fichier
RR-4339.pdf (393.65 Ko) Télécharger le fichier

Dates and versions

inria-00072249 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00072249 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More