Advertisement

Annals of Operations Research

, Volume 162, Issue 1, pp 69–83 | Cite as

Mean queue size in a queue with discrete autoregressive arrivals of order p

  • Jeongsim Kim
  • Bara KimEmail author
  • Khosrow Sohraby
Article

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Addie, R. G., & Zukerman, M. (1994). Performance evaluation of a single server autoregressive queue. Australian Telecommunication Research, 28(1), 25–32. Google Scholar
  2. Choi, B. D., Kim, B., Hwang, G. U., & Kim, J.-K. (2004). The analysis of a multi server queue fed by discrete time autoregressive process of order 1. Operations Research Letters, 32(1), 85–93. CrossRefGoogle Scholar
  3. Dehnert, M., Helm, W. E., & Hutt, M.-T. (2003). A discrete autoregressive process as a model for short-range correlations in DNA sequences. Physica A, 327, 535–553. CrossRefGoogle Scholar
  4. Dehnert, M., Helm, W. E., & Hutt, M.-T. (2005). Information theory reveals large-scale synchronisation of statistical correlations in eukaryote genomes. Gene, 345, 81–90. CrossRefGoogle Scholar
  5. Elwalid, A., Heyman, D., Lakshman, T. V., Mitra, D., & Weiss, A. (1995). Fundamental bounds and approximations for ATM multiplexers with applications to video teleconferencing. IEEE Journal on Selected Areas in Communications, 13(6), 1004–1016. CrossRefGoogle Scholar
  6. Finch, P. D., & Pearce, C. (1965). A second look at a queueing system with moving average input process. Journal of the Australian Mathematical Society, 5, 100–106. CrossRefGoogle Scholar
  7. He, J., & Sohraby, K. (2003). An extended combinatorial analysis framework for discrete-time queueing systems with general sources. IEEE/ACM Transactions on Networking, 11(1), 95–110. CrossRefGoogle Scholar
  8. Heyman, D., Tabatabai, A., & Lakshman, T. V. (1992). Statistical analysis and simulation study of video teleconferencing traffic in ATM networks. IEEE Transactions on Circuits and Systems for Video Technology, 2(1), 49–59. CrossRefGoogle Scholar
  9. Hwang, G. U., & Kim, B. (2008). Mean queue length in a discrete time queue with stationary arrivals. Submitted. Google Scholar
  10. Hwang, G. U., & Sohraby, K. (2003). On the exact analysis of a discrete-time queueing system with autoregressive inputs. Queueing Systems, 43(1–2), 29–41. CrossRefGoogle Scholar
  11. Hwang, G. U., Choi, B. D., & Kim, J.-K. (2002). The waiting time analysis of a discrete time queue with arrivals as an autoregressive process of order 1. Journal of Applied Probability, 39(3), 619–629. CrossRefGoogle Scholar
  12. Jacobs, P. A., & Lewis, P. A. W. (1978). Discrete time series generated by mixtures. III: Autoregressive processes (DAR(p)) (Technical Report NPS55-78-022). Naval Postgraduate School. Google Scholar
  13. Jacobs, P. A., & Lewis, P. A. W. (1983). Stationary discrete autoregressive-moving average time series generated by mixtures. Journal of Time Series Analysis, 4(1), 19–36. Google Scholar
  14. Kim, B., & Sohraby, K. (2006). Tail behavior of the queue size and waiting time in a queue with discrete autoregressive arrivals. Advances in Applied Probability, 38, 1116–1131. CrossRefGoogle Scholar
  15. Kim, B., Chang, Y., Kim, Y. C., & Choi, B. D. (2007). A queueing system with discrete autoregressive arrivals. Performance Evaluation, 64, 148–161. CrossRefGoogle Scholar
  16. McKenzie, E. (2003). Discrete variate time series. In D. N. Shanbhag & C. R. Rao (Eds.), Handbook of statistics 21, stochastic processes: modelling and simulation (pp. 573–606). Amsterdam: North-Holland. Google Scholar
  17. Neuts, M. F. (1989). Structured stochastic matrices of M/G/1 type and their applications. New York: Marcel Dekker. Google Scholar
  18. Pearce, C. (1966). A queueing system with general moving average input and negative exponential service time. Journal of the Australian Mathematical Society, 6, 223–236. Google Scholar
  19. Ryu, B. K., & Elwalid, A. (1996). The importance of long-range dependence of VBR video traffic in ATM traffic engineering: myths and realities. In ACM SIGCOMM (pp. 3–14). Stanford, CA. Google Scholar
  20. Widjaja, I., & Elwalid, A. (1998). Performance issues in VC-merge capable switches for IP over ATM networks. In Proceedings of IEEE INFOCOM’98 (Vol. 1, pp. 372–380). Google Scholar
  21. Widjaja, I., & Elwalid, A. (1999). Performance issues in VC-merge capable switches for multiprotocol label switching. IEEE Journal on Selected Areas in Communications, 17(6), 1178–1189. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Department of Mathematics EducationChungbuk National UniversityChungbukKorea
  2. 2.Department of Mathematics and Telecommunication Mathematics Research CenterKorea UniversitySeoulKorea
  3. 3.School of Computing and EngineeringUniversity of Missouri-Kansas CityKansas CityUSA

Personalised recommendations