Hostname: page-component-cb9f654ff-plnhv Total loading time: 0.001 Render date: 2025-08-19T20:43:29.335Z Has data issue: false hasContentIssue false
  • English
  • Français

Queues with moving average service times

Published online by Cambridge University Press:  14 July 2016

C. Pearce
C. Pearce*
Affiliation:
University of Sheffield
Get access Rights & Permissions [Opens in a new window]

Abstract

A model for the service time structure in the single server queue is given embodying correlations between contiguous and near-contiguous service times. A number of results are derived in the case of Poisson arrivals both for equilibrium and the transient state. In particular, Kendall's (equilibrium) result P (a departure leaves the queue empty) = 1 — (mean service time)/(mean inter-arrival time) is found still to hold good. The effect of the correlation on the mean and variance of the equilibrium queue length distribution is examined in a simple case.

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 4 , Issue 3 , November 1967 , pp. 553 - 570
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.)

Article purchase

Temporarily unavailable

References

[1] Loynes, R. M. (1962) Stationary waiting time distribution for single-server queues. Ann. Math. Statist. 33, 1323–1339.Google Scholar
[2] Pearce, C. (1966) A queueing system with general moving average input and negative exponential service time. J. Aust. Math. Soc. 6, 223–236.Google Scholar
[3] Loynes, R. M. (1962) The stability of a queue with non-independent arrival and service times. Proc. Camb. Phil. Soc. 58, 497–520.Google Scholar
[4] Kendall, D. G. (1951) Some problems in the theory of queues. J. R. Statist. Soc. B 13, 151–185.Google Scholar
[5] Winsten, C. B. (1959) Geometric distributions in the theory of queues. J. R. Statist. Soc. B 21, 1–35.Google Scholar
[6] Finch, P. D. (1960) On the transient behaviour of a simple queue. J. R. Statist. Soc. B 22, 277–284.Google Scholar
[7] Bhat, U. N. (1963) Imbedded Markov chain analysis of bulk queues. J. Aust. Math. Soc. 4, 244–263.Google Scholar