Abstract

AbstractA 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call