Hostname: page-component-745bb68f8f-mzp66 Total loading time: 0 Render date: 2025-01-11T04:15:50.614Z Has data issue: false hasContentIssue false
  • English
  • Français

Imbedded Markov chain analysis of single server bulk queues

Published online by Cambridge University Press:  09 April 2009

U. Narayan Bhat
U. Narayan Bhat
Affiliation:
The University of Western Australia
Rights & Permissions [Opens in a new window]

Summary

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 this paper results from Fluctuation Theory are used to analyse the imbedded Markov chains of two single server bulk-queueing systems, (i)with Poisson arrivals and arbitrary service time distribution and (ii) with arbitrary inter-arrival time distribution and negative exponential service time. The discrete time transition probailities and the equilibrium behaviour of the queue lengths of the systems have been obtained along with distributions concerning the busy periods. From the general results several special cases have been derived.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 4 , Issue 2 , May 1964 , pp. 244 - 263
Copyright
Copyright © Australian Mathematical Society 1964

References

[1]Bailey, N. T. J., On Queueing Processes with Bulk Service, J. Roy. Stat. Soc. B16 (1954), 80–87.Google Scholar
[2]Boudreau, P. E., Griffin, J. S. Jr, and Kac, Mark, An Elementary Queueing Problem, Amer. Math. Monthly 68 (1962) 713–724.CrossRefGoogle Scholar
[3]Feller, W., On Combinatorial Methods in Fluctuation Theory, Probability and Statistics, Harald Cramer Volume, John Wiley and Sons, (1959), 75–91.Google Scholar
[4]Foster, F. G., Queues with Batch Arrivals I, Acta Math. Acad. Sci. Hung. 12 (1961), 1–10.CrossRefGoogle Scholar
[5]Foster, F. G., and Nyunt, K. M., Queues with Batch Departures I, Ann. Math. Stat. 32 (1961), 1324–1332.CrossRefGoogle Scholar
[6]Jaiswal, N. K., A Bulk-Service Queueing Problem with Variable Capacity, J. Roy. Stat. Soc. B23 (1961), 143–148.Google Scholar
[7]Keilson, J., The General Bulk Queue as a Hilbert Problem, J. Roy. Stat. Soc. B24 (1962), 344–358.Google Scholar
[8]Kemperman, J. H. B., The Passage Problem of a Stationary Markov Chain, The University of Chicago Press (1961).CrossRefGoogle Scholar
[9]Kendall, D. G., Stochastic Processes occurring in the Theory of Queues and Their Analysis by the Method of Imbedded Markov Chain, Ann. Math. Stat. 24 (1953), 338–354.CrossRefGoogle Scholar
[10]Miller, R. G. Jr, A Contribution to the Theory of Bulk Queues, J. Roy. Stat. Soc. B21 (1959), 320–337.Google Scholar
[11]Prabhu, N. U., and Narayan, Bhat U., Some First Passage Problems and Their Application to Queues, Sankkya A25 (1963), 281–292.Google Scholar
[12]Spitzer, F., A Combinatorial Lemma and its Application to Probability Theory, Trans. Amer. Math. Soc. 82 (1956), 323–339.CrossRefGoogle Scholar
[13]Takács, L., Transient Behaviour of Single Server Queueing Processes with Erlang Input, Trans. Amer. Math. Soc. 100 (1961), 1–28.CrossRefGoogle Scholar
[14]Takács, L., Transient Behaviour of Single Server Queueing Processes with Recurrent Input and Gamma Service Time, Ann. Math. Stat. 32 (1961), 1286–1298.CrossRefGoogle Scholar
[15]Gaver, D. P. Jr, Imbedded Markov Chain Analysis of a Waiting Line Process in Continuous Time, Ann. Math. Stat. 30 (1959), 698–720.CrossRefGoogle Scholar