M/G/c/K blocking probability models and system performance

Authors:
J. MacGregor Smith
Affiliations:
Department of Mechanical and Industrial Engineering, University of Massachusetts, Marston Hall, Room 111B, Amherst, MA
Venue:
Performance Evaluation
Year:
2003

Citing 7
Cited 4

Fundamentals of queueing theory (2nd ed.).

Fundamentals of queueing theory (2nd ed.).
Stochastic modelling and analysis: a computational approach

Stochastic modelling and analysis: a computational approach
Strong convexity results for queueing systems

Operations Research
Sharp bounds and simple approximations for the Erlang delay and loss formulas

Management Science
Evaluating the overflow probability using the infinite queue

Management Science
Diffusion based statistical call admission control in ATM

Performance Evaluation
On Approximate Computer System Models

Journal of the ACM (JACM)

Buffer allocation in general single-server queueing networks

Computers and Operations Research
Design of a fuzzy finite capacity queuing model based on the degree of customer satisfaction: Analysis and fuzzy optimization

Fuzzy Sets and Systems
Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems

Computers and Operations Research
Input uncertainty in outout analysis

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.01

Visualization

Abstract

An exact solution for the M/G/c/K model is only possible for special cases, such as exponential service, a single server, or no waiting room at all. Instead of basing the approximation on an infinite capacity queue as is often the case, an approximation based on a closed-form expression derivable from the finite capacity exponential queue is presented. Properties of the closed-form expression along with its use in approximating the blocking probability of M/G/c/K systems are discussed. Extensive experiments are provided to test and verify the efficacy of our approximate results.