Mean queue size in a queue with discrete autoregressive arrivals of order p
- Authors
- Kim, Jeongsim; Kim, Bara; Sohraby, Khosrow
- Issue Date
- 9월-2008
- Publisher
- SPRINGER
- Keywords
- discrete autoregressive process; discrete time queueing system; mean queue size
- Citation
- ANNALS OF OPERATIONS RESEARCH, v.162, no.1, pp.69 - 83
- Indexed
- SCIE
SCOPUS
- Journal Title
- ANNALS OF OPERATIONS RESEARCH
- Volume
- 162
- Number
- 1
- Start Page
- 69
- End Page
- 83
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/122755
- DOI
- 10.1007/s10479-008-0318-1
- ISSN
- 0254-5330
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Science > Department of Mathematics > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.