Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-22T04:46:50.163Z Has data issue: false hasContentIssue false

Asymptotic correlation in a queue

Published online by Cambridge University Press:  14 July 2016

B. D. Craven*
Affiliation:
University of Melbourne and University of Sheffield

Extract

Let Xt denote the waiting time of customer t in a stationary GI/G/1 queue, with traffic intensity τ; let ρn denote the correlation between Xt and Xt+n. For a rational GI/G/1 queue, in which the distribution of the difference between arrival and service intervals has a rational characteristic function, it is shown that, for large n, ρn is asymptotically proportional to n3/2eβn, where β and the factor of proportionality are calculable. The asymptotic law n–3/2e–βn applies also to the approach of the waiting-time distribution to the stationary state in an initially empty rational GI/G/1 queue, and to the correlations in the queueing systems recently analysed by Cohen [1]. Its more general applicability is discussed.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Cohen, J. W. (1967) On two integral equations of queueing theory. J. Appl. Prob. 4, 343355.CrossRefGoogle Scholar
[2] Copson, E. T. (1935) Theory of Functions of a Complex Variable. Oxford University Press.Google Scholar
[3] Craven, B. D. (1965) Serial dependence of a Markov process. J. Aust. Math. Soc. 5, 299314.CrossRefGoogle Scholar
[4] Craven, B. D. (1963) Asymptotic transient behaviour of the bulk service queue. J. Aust. Math. Soc. 3, 503512.CrossRefGoogle Scholar
[5] Daley, D. J. (1968) The serial correlation coefficients of waiting times in a stationary single server queue. J. Aust. Math. Soc. 8, 683699.CrossRefGoogle Scholar
[6] Keilson, J. (1964) An alternative to Wiener-Hopf methods for the study of bounded processes. J. Appl. Prob. 1, 85120.CrossRefGoogle Scholar
[7] Kingman, J. F. C. (1966) On the algebra of queues. J. Appl. Prob. 3, 285326.CrossRefGoogle Scholar
[8] Lindley, D. V. (1952) The theory of queues with a single server. Proc. Camb. Phil. Soc. 48, 277295.CrossRefGoogle Scholar
[9] Smith, W. L. (1953) Distribution of queueing times. Proc. Camb. Phil. Soc. 49, 449463.CrossRefGoogle Scholar