Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-23T23:14:12.686Z Has data issue: false hasContentIssue false
  • English
  • Français

A queueing system with moving average input process and batch arrivals

Published online by Cambridge University Press:  09 April 2009

C. Pearce
C. Pearce
Affiliation:
The Australian National University, Canberra
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In a recent paper by P. D. Finch and myself [1], the solution for the limiting distribution of a moving average queueing system was obtained. In this paper the system is generalised to the case of batch arrivals in batches of size ρ > 1.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 5 , Issue 4 , November 1965 , pp. 434 - 442
Copyright
Copyright © Australian Mathematical Society 1965

References

[1]Finch, P. D., and Pearce, C., “A second look at a queueing system with moving average input process”, J. Aust. Math. Soc. 5 (1965), 100–106.CrossRefGoogle Scholar
[2]Finch, P. D., “The single server queueing system with non-recurrent input-process and Erlang service time”, J. Aust. Math. Soc. 3 (1963), 220–236.CrossRefGoogle Scholar