Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-23T18:38:26.160Z Has data issue: false hasContentIssue false
  • English
  • Français

A transient solution to an M/M/1 queue: a simple approach

Published online by Cambridge University Press:  01 July 2016

P. R. Parthasarathy
P. R. Parthasarathy*
Affiliation:
Indian Institute of Technology, Madras
*
∗Postal address: Department of Mathematics, Indian Institute of Technology, Madras 600–036, India.
Rights & Permissions [Opens in a new window]

Abstract

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.

A time-dependent solution for the number in a single-server queueing system with Poisson arrivals and exponential service times is derived in a direct way.

Type
Letters to the Editor
Information
Advances in Applied Probability , Volume 19 , Issue 4 , December 1987 , pp. 997 - 998
Copyright
Copyright © Applied Probability Trust 1987 

References

Champernowne, D. G. (1956) An elementary method of solution of the queueing problem with a single server and continuous parameter. J. R. Statist. Soc. B 18, 125–128.Google Scholar
Conolly, B. W. (1958) A difference equation technique applied to a simple queue with arbitrary arrival interval distribution. J. R. Statist. Soc. B 21, 168–175.Google Scholar
Karlin, S. and Mcgregor, J. (1959) Many server queueing processes with Poisson input and exponential service times. Pacific J. Math. 8, 87–118.CrossRefGoogle Scholar
Ledermann, W. and Reuter, , (1956) Spectral theory for the differential equations of simple birth and death equations of simple birth and death process. Phil. Trans. R. Soc. London A 246, 321–369.Google Scholar
Pegden, C. D. and Rosenshine, M. (1982) Some new results for the M/M/1 queue. Management Sci. 28, 821–828.CrossRefGoogle Scholar