Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-10T11:44:06.392Z Has data issue: false hasContentIssue false

Lower bounds for the probability of overload in certain queueing networks

Published online by Cambridge University Press:  14 July 2016

Marek Kanter*
Affiliation:
Mentor Graphics, Santa Clara
*
Postal address: 2134 Grant St, Berkeley, CA 94703, USA.

Abstract

Conservative estimates for the probability that open queueing networks are not overloaded during any finite set of time points are derived. The queueing networks have infinitely many servers at each queue and general service times. A key preliminary result is that for multidimensional Markov population processes, the correspondence between initial distributions and their temporal development preserves stochastic order.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1985 

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

Doob, J. L. (1952) Stochastic Processes. Wiley, New York.Google Scholar
Horduk, A. and Van Dijk, A. (1982) Stationary probabilities for networks of queues. In Applied Probability and Computer Science, the Interface, ed. Disney, R. L. and Ott, T. J., Birkaüser, Boston.Google Scholar
Kelly, F. (1979) Reversibility and Stochastic Networks. Wiley, New York.Google Scholar
Kingman, J. F. C. (1969) Markov population processes. J. Appl. Prob. 6, 118.CrossRefGoogle Scholar
Lehman, E. (1955) Ordered families of distributions. Ann. Math. Statist. 26, 399419.Google Scholar
Lehman, E. (1966) Some concepts of dependence. Ann. Math. Statist. 37, 11371153.Google Scholar
Ross, S. M. (1983) Stochastic Processes. Wiley, New York.Google Scholar