Skip to main content
Log in

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

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  • Addie, R. G., & Zukerman, M. (1994). Performance evaluation of a single server autoregressive queue. Australian Telecommunication Research, 28(1), 25–32.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Hwang, G. U., & Kim, B. (2008). Mean queue length in a discrete time queue with stationary arrivals. Submitted.

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

  • 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 

  • 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.

    Article  Google Scholar 

  • Kim, B., Chang, Y., Kim, Y. C., & Choi, B. D. (2007). A queueing system with discrete autoregressive arrivals. Performance Evaluation, 64, 148–161.

    Article  Google Scholar 

  • 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 

  • Neuts, M. F. (1989). Structured stochastic matrices of M/G/1 type and their applications. New York: Marcel Dekker.

    Google Scholar 

  • 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 

  • 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.

  • 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).

  • 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.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bara Kim.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kim, J., Kim, B. & Sohraby, K. Mean queue size in a queue with discrete autoregressive arrivals of order p . Ann Oper Res 162, 69–83 (2008). https://doi.org/10.1007/s10479-008-0318-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-008-0318-1

Keywords

Navigation