arXiv Open Access 2013

Analysis of a non-work conserving Generalized Processor Sharing queue

Fabrice Guillemin
Lihat Sumber

Abstrak

We consider in this paper a non work-conserving Generalized Processor Sharing (GPS) system composed of two queues with Poisson arrivals and exponential service times. Using general results due to Fayolle \emph{et al}, we first establish the stability condition for this system. We then determine the functional equation satisfied by the generating function of the numbers of jobs in both queues and the associated Riemann-Hilbert problem. We prove the existence and the uniqueness of the solution. This allows us to completely characterize the system, in particular to compute the empty queue probability. We finally derive the tail asymptotics of the number of jobs in one queue.

Topik & Kata Kunci

Penulis (1)

F

Fabrice Guillemin

Format Sitasi

Guillemin, F. (2013). Analysis of a non-work conserving Generalized Processor Sharing queue. https://arxiv.org/abs/1305.3536

Akses Cepat

Lihat di Sumber
Informasi Jurnal
Tahun Terbit
2013
Bahasa
en
Sumber Database
arXiv
Akses
Open Access ✓