The waiting time analysis of a discrete-time queue with arrivals as a discrete autoregressive process of order 1

We consider a discrete-time queueing system with the discrete autoregressive process of order 1 (DAR(1)) as an input process and obtain the actual waiting time distribution and the virtual waiting time distribution. As shown in the analysis, our approach provides a natural numerical algorithm to compute the waiting time distributions, based on the theory of the GI/G/1 queue, and consequently we can easily investigate the effect of the parameters of the DAR(1) on the waiting time distributions. We also derive a simple approximation of the asymptotic decay rate of the tail probabilities for the virtual waiting time in the heavy traffic case.

[1]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[2]  Walter L. Smith On the distribution of queueing times , 1953, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

[4]  M. J. Fryer,et al.  An Algorithm to Compute the Equilibrium Distribution of a One-Dimensional Bounded Random Walk , 1986, Oper. Res..

[5]  Winfried K. Grassmann,et al.  Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 Queue , 1989, Oper. Res..

[6]  A. J. Lawrance,et al.  An exponential moving-average sequence and point process (EMA1) , 1977, Journal of Applied Probability.

[7]  P. D. Finch,et al.  A second look at a queueing system with moving average input process , 1965 .

[8]  Gang Uk Hwang,et al.  On the Exact Analysis of a Discrete-Time Queueing System with Autoregressive Inputs , 2003, Queueing Syst. Theory Appl..

[9]  J. Kingman Inequalities in the Theory of Queues , 1970 .

[10]  Ward Whitt,et al.  A heavy-traffic expansion for asymptotic decay rates of tail probabilities in multichannel queues , 1994, Oper. Res. Lett..

[11]  M. Ackroyd Computing the Waiting Time Distribution for the G/G/1 Queue by Signal Processing Methods , 1980, IEEE Trans. Commun..

[12]  N. U. Prabhu,et al.  Stochastic Storage Processes: Queues, Insurance Risk, Dams, and Data Communication , 1997 .

[13]  Ward Whitt,et al.  Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times , 1995, Oper. Res..

[14]  Henk Tijms,et al.  Stochastic modelling and analysis: a computational approach , 1986 .

[15]  P. Young,et al.  Time series analysis, forecasting and control , 1972, IEEE Transactions on Automatic Control.

[16]  Alan G. Konheim,et al.  An Elementary Solution of the Queuing System G/G/1 , 1975, SIAM J. Comput..

[17]  T. V. Lakshman,et al.  Fundamental Bounds and Approximations for ATM Multiplexers with Applications to Video Teleconferencing , 1995, IEEE J. Sel. Areas Commun..