Article contents
Lower bounds for the probability of overload in certain queueing networks
Published online by Cambridge University Press: 14 July 2016
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
- Information
- Copyright
- Copyright © Applied Probability Trust 1985
References
- 4
- Cited by