Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-25T05:03:31.462Z Has data issue: false hasContentIssue false

Transient solution to the many-server Poisson queue: a simple approach

Published online by Cambridge University Press:  14 July 2016

P. R. Parthasarathy*
Affiliation:
Indian Institute of Technology, Madras
M. Sharafali*
Affiliation:
Government Arts College, Nandanam, Madras
*
Postal address: Department of Mathematics, Indian Institute of Technology, Madras 600 036, India.
∗∗Postal address: Department of Mathematics, Government Arts College, Nandanam, Madras 600 035, India.

Abstract

An elegant time-dependent solution for the number in the M/M/c queueing system is derived in a direct way.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1989 

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

Chaudhury, M. L. and Templeton, J. G. C. (1973) A note on the distribution of a busy period for M/M/c queueing system, Math. Operationsforsch. Statist. 4, 7579.CrossRefGoogle Scholar
Ledermann, W. and Reuter, G. E. H. (1954) Spectral theory for the differential equations of simple birth and death processes, Phil. Trans. R. Soc. London 246, 321369.Google Scholar
Parthasarathy, P. R. (1987) A transient solution to a M/M/1 queue — a simple approach. Adv. Appl. Prob. 19, 997998.Google Scholar
Raju, S. N. and Bhat, U. N. (1982) A computationally oriented analysis of the G/M/1 queue. Opsearsh 19, 6783.Google Scholar
Saaty, T. L. (1960) Time-dependent solution of the many server Poisson queue. Operat. Res. 8, 755771.Google Scholar
Saaty, T. L. (1961) Elements of Queueing Theory, with Applications. McGraw-Hill, New York.Google Scholar