Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 69-83 |
| Number of pages | 15 |
| Journal | Annals of Operations Research |
| Volume | 162 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2008 Sep |
Keywords
- Discrete autoregressive process
- Discrete time queueing system
- Mean queue size
ASJC Scopus subject areas
- Decision Sciences(all)
- Management Science and Operations Research
Fingerprint Dive into the research topics of 'Mean queue size in a queue with discrete autoregressive arrivals of order p'. Together they form a unique fingerprint.
Cite this
Kim, J., Kim, B., & Sohraby, K. (2008). Mean queue size in a queue with discrete autoregressive arrivals of order p. Annals of Operations Research, 162(1), 69-83. https://doi.org/10.1007/s10479-008-0318-1