Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-25T06:11:52.306Z Has data issue: false hasContentIssue false
  • English
  • Français

Exponential spectra as a tool for the study of server-systems with several classes of customers

Published online by Cambridge University Press:  14 July 2016

J. Keilson
J. Keilson*
Affiliation:
University of Rochester
Get access Rights & Permissions [Opens in a new window]

Abstract

For a single-server system having several Poisson streams of customers with exponentially distributed service times, busy period densities, waiting time densities, and idle state probabilities are completely monotone. The exponential spectra for such densities are of importance for understanding the transient behavior of such systems. Algorithms are given for the computation of such spectra. Applications to heavy traffic situations and priority systems are also discussed.

Keywords

QUEUESBUSY PERIOD DENSITYPRIORITY QUEUESWAITING TIMESCOMPLETE MONOTONICITYEXPONENTIAL SPECTRAHEAVY TRAFFIC
Type
Research Papers
Information
Journal of Applied Probability , Volume 15 , Issue 1 , March 1978 , pp. 162 - 170
Copyright
Copyright © Applied Probability Trust 1978 

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

[1] Cohen, J. W. (1969) The Single-Server Queue. North-Holland, Amsterdam.Google Scholar
[2] Epstein, B. (1972) Linear Functional Analysis. Saunders, New York.Google Scholar
[3] Feller, W. (1966) An Introduction to Probability Theory and Its Applications, Vol. 2. Wiley, New York.Google Scholar
[4] Gaver, D. P. (1962) A waiting line with interrupted service, including priorities. J. R. Statist. Soc. B 24, 73–90.Google Scholar
[5] Keilson, J. (1962) Queues subject to service interruption. Ann. Math. Statist. 33, 1314–1322.Google Scholar
[6] Keilson, J. (1964) Some comments on single server queuing methods and some new results. Proc. Camb. Phil. Soc. 60, 237–251.Google Scholar
[7] Keilson, J. and Callaert, H. (1973) On exponential ergodicity and spectral structure for birth-death processes. Stoch. Proc. Appl. 1, 187–235.Google Scholar
[8] Keilson, J. and Kooharian, A. (1960) On time dependent queuing processes. Ann. Math. Statist. 31, 104–112.Google Scholar
[9] Keilson, J. (1974) Sojourn times, exit times and jitter in multivariate Markov processes. Adv. Appl. Prob. 6, 747–756.CrossRefGoogle Scholar
[10] Keilson, J. and Steutel, F. W. (1974) Mixtures of distributions moment inequalities and measures of exponentiality and normality. Ann. Prob. 1, 112–130.Google Scholar
[11] Kingman, J. F. C. (1962) On queues in heavy traffic. J. R. Statist. Soc. B 24, 383–392.Google Scholar
[12] Takács, L. (1962) The time dependence of a single-server queue with Poisson input and general service times. Ann. Math. Statist. 33, 1340–1348.Google Scholar