Mean queue size in a queue with discrete autoregressive arrivals of order <Emphasis Type="Italic">p</Emphasis> |
| |
| Authors: | Jeongsim Kim Bara Kim Khosrow Sohraby |
| |
| Institution: | (1) Department of Mathematics Education, Chungbuk National University, 12, Gaeshin-dong, Heungduk-ku, Cheongju, Chungbuk, 361-763, Korea;(2) Department of Mathematics and Telecommunication Mathematics Research Center, Korea University, 1, Anam-dong, Sungbuk-ku, Seoul, 136-701, Korea;(3) School of Computing and Engineering, University of Missouri-Kansas City, Kansas City, MO 64110, USA |
| |
| 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. |
| |
| Keywords: | Discrete autoregressive process Discrete time queueing system Mean queue size |
| 本文献已被 SpringerLink 等数据库收录！ |
|
