Hostname: page-component-74656f9884-8r8nv Total loading time: 0 Render date: 2026-11-08T17:58:51.249Z Has data issue: false hasContentIssue false

Sensitivity bounds on a GI/M/n/n queueing system

Published online by Cambridge University Press:  17 February 2009

Andrew Coyle
Affiliation:
Department of Applied Mathematics, The University of Adelaide, South Australia 5001.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1989