The serial correlation coefficients of waiting times in a stationary single server queue
- 1 November 1968
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- Vol. 8 (4), 683-699
- https://doi.org/10.1017/s1446788700006509
Abstract
Summary: In a stationaryGI/G/1 queueing system in which the waiting time variance is finite, it can be shown that the serial correlation coefficients {ρn} of a (stationary) sequence of waiting times are non-negative and decrease monotonically to zero. By means of renewal theory we find a representation for Σ∞0ρnfrom which necessary and sufficient condition for its finiteness can be found. InM/G/1 rather more can be said: {ρn} is convex sequence, the asymptotic form of ρncan be given in a nearly saturated queue, and a simple explicit expression for Σ∞0ρnexists. For the stationaryM/M/1queue we find the ρn's explicitly, illustrate them numerically, and derive a representation which shows that {ρn} is completely monotonic.Keywords
This publication has 6 references indexed in Scilit:
- The Correlation Structure of the Output Process of Some Single Server Queueing SystemsThe Annals of Mathematical Statistics, 1968
- On the rate of convergence of waiting timesJournal of the Australian Mathematical Society, 1965
- Serial dependence of a Markov processJournal of the Australian Mathematical Society, 1965
- The Covariance Function of a Simple Trunk Group, with Applications to Traffic Measurement*Bell System Technical Journal, 1961
- On the Characteristics of the General Queueing Process, with Applications to Random WalkThe Annals of Mathematical Statistics, 1956
- Stochastic Properties of Waiting LinesJournal of the Operations Research Society of America, 1955