Article contents
Sensitivity bounds on a GI/M/n/n queueing system
Published online by Cambridge University Press: 17 February 2009
Abstract
A method for determining the upper and lower bounds for performance measures for certain types of Generalised Semi-Markov Processes has been described in Taylor and Coyle [8]. A brief description of this method and its use in finding an upper bound for the time congestion of a GI/M/n/n queueing system will be given. This bound turns out to have a simple form which is quickly calculated and easy to use in practice.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1989
References
- 1
- Cited by