Abstract
We consider a single-server queueing system. The arrival process is modelled as a Poisson process while the service times of the consecutive customers constitute a sequence of autoregressive random variables. Our interest into autoregressive service times comes from the need to capture temporal correlation of the channel conditions on wireless network links. If these fluctuations are slow in comparison with the transmission times of the packets, transmission times of consecutive packets are correlated. Such correlation needs to be taken into account for an accurate performance assessment. By means of a transform approach, we obtain a functional equation for the joint transform of the queue content and the current service time at departure epochs in steady state. To the best of our knowledge, this functional equation cannot be solved by exact mathematical techniques, despite its simplicity. However, by means of a Taylor series expansion in the parameter of the autoregressive process, a “light-correlation” approximation is obtained for performance measures such as moments of the queue content and packet delay. We illustrate our approach by some numerical examples, thereby assessing the accuracy of our approximations by simulation. For the heavy correlation case, we give differential equation approximations based on the time-scale separation technique, and present numerical examples in support of this approximation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Altman, E., Avrachenkov, K. E., & Nunez-Queija, R. (2004). Perturbation analysis for denumerable Markov chains with application to queueing models. Advances in Applied Probability, 36(3), 839–853.
Blanc, J. P. C. (1992). The power-series algorithm applied to the shortest-queue model. Operations Research, 40(1), 157–167.
Blanc, J. P. C. (1998). The power-series algorithm for polling systems with time limits. Probability in the Engineering and Informational Sciences, 12, 221–237.
Błaszczyszyn, B., Rolski, T., & Schmidt, V. (1995). Light-traffic approximations in queues and related stochastic models. In Advances in queueing: theory, methods and open problems. Boca Raton: CRC Press.
Choi, B. D., Kim, B., Hwang, G. U., & Kim, J. K. (2004). The analysis of a multiserver queue fed by a discrete autoregressive process of order 1. Operations Research Letters, 32(1), 85–93.
Choudhury, G. L., Mandelbaum, A., Reiman, M. I., & Whitt, W. (1997). Fluid and diffusion limits for queues in slowly changing environments. Stochastic Models, 13, 121–146.
Cohen, J. (1969). The single server queue. Amsterdam: North-Holland.
Courtois, P. J. (1977). Decomposability, queueing and computer system applications. New York: Academic Press.
Dieudonné, J. (1969). Foundations of modern analysis. New York: Academic Press.
Gong, W., & Hu, J. (1992). The MacLaurin series for the GI/G/1 queue. Journal of Applied Probability, 29(1), 176–184.
Heidergott, B., & Hordijk, A. (2003). Taylor series expansions for stationary Markov chains. Advances in Applied Probability, 35(4), 1046–1070.
Hooghiemstra, G., Keane, M., & Vanderee, S. (1988). Power-series for stationary distributions of coupled processor models. SIAM Journal on Applied Mathematics, 48(5), 1159–1166.
Hwang, G. U., & Choi, B. D. (2004). Performance analysis of the DAR(1)/D/c priority queue under partial buffer sharing policy. Computers & Operations Research, 31(13), 2231–2247.
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.
Hwang, G. U., Choi, B. D., & Kim, J. K. (2002). The waiting time analysis of a discrete-time queue with arrivals as a discrete autoregressive process of order 1. Journal of Applied Probability, 39(3), 619–629.
Kamoun, F. (2006). The discrete-time queue with autoregressive inputs revisited. Queueing Systems, 54(3), 185–192.
Kim, J., & Kim, B. (2007). Regularly varying tails in a queue with discrete autoregressive arrivals of order p. Queueing Systems, 56(2), 93–102.
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(4), 1116–1131.
Kim, B., Chang, Y., Kim, Y. C., & Choi, B. D. (2007). A queueing system with discrete autoregressive arrivals. Performance Evaluation, 64(2), 148–161.
Kushner, H. J., & Yin, G. G. (2003). Stochastic approximation and recursive algorithms and applications. New York: Springer.
Meyn, S., & Tweedie, R. L. (2009). Markov chains and stochastic stability (2nd edn.). Cambridge: Cambridge University Press.
Schweitzer, P. J. (1968). Perturbation theory and finite Markov chains. Journal of Applied Probability, 5(2), 401–413.
Sharma, V., Virtamo, J., & Lassila, P. (2002). Performance analysis of the random early detection algorithm. Probability in the Engineering and Informational Sciences, 16(3), 367–388.
Simon, H. A., & Ando, A. (1961). Aggregation of variables in dynamic systems. Econometrica, 29(2), 111–138.
Takagi, H. (1991). Vacation and priority systems, part 1: Vol. 1. Queueing analysis; a foundation of performance evaluation. Elsevier: Amsterdam.
Walraevens, J., van Leeuwaarden, J. S. H., & Boxma, O. J. (2010). Power series approximations for generalized processor sharing systems. Queueing Systems, 66(2), 107–130.
Yin, G. G., & Zhang, Q. (1997). Continuous-time markov chains and applications: a singular perturbation approach. New York: Springer.
Yin, G. G., & Zhang, Q. (2005). Discrete-time Markov chains: two-time-scale methods and applications. New York: Springer.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fiems, D., Prabhu, B. & De Turck, K. Analytic approximations of queues with lightly- and heavily-correlated autoregressive service times. Ann Oper Res 202, 103–119 (2013). https://doi.org/10.1007/s10479-011-0946-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-011-0946-8