We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Mean queue size in a queue with discrete autoregressive arrivals of order p.
- Authors
Jeongsim Kim; Bara Kim; Sohraby, Khosrow
- 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.
- Subjects
QUEUEING networks; DISCRETE-time systems; CLIENT/SERVER computing; APPROXIMATION theory; COMPUTER simulation; DATA transmission systems simulations
- Publication
Annals of Operations Research, 2008, Vol 162, Issue 1, p69
- ISSN
0254-5330
- Publication type
Article
- DOI
10.1007/s10479-008-0318-1