Mean queue size in a queue with discrete autoregressive arrivals of order p
| Autor: | Khosrow Sohraby, Jeongsim Kim, Bara Kim |
|---|---|
| Rok vydání: | 2008 |
| Předmět: |
Discrete mathematics
D/M/1 queue Kendall's notation Queueing theory M/G/k queue Computer science M/D/1 queue M/M/1 queue General Decision Sciences M/D/c queue G/G/1 queue Management Science and Operations Research Fork–join queue M/M/∞ queue Computer Science::Performance Discrete time and continuous time Burke's theorem Mean value analysis Computer Science::Networking and Internet Architecture M/G/1 queue Applied mathematics M/M/c queue Pollaczek–Khinchine formula Queue Bulk queue |
| Zdroj: | Annals of Operations Research. 162:69-83 |
| ISSN: | 1572-9338 0254-5330 |
| DOI: | 10.1007/s10479-008-0318-1 |
| Popis: | We consider a discrete time single server queueing system where the arrival process is governed by a discrete autoregressive process of order p (DAR(p)), and the service time of a customer is one slot. For this queueing system, we give an expression for the mean queue size, which yields upper and lower bounds for the mean queue size. Further we propose two approximation methods for the mean queue size. One is based on the matrix analytic method and the other is based on simulation. We show, by illustrations, that the proposed approximations are very accurate and computationally efficient. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|