Approximations for the delay probability in the M/G/s queue

Authors:
T. Kimura
Affiliations:
Department of Business Administration, Hokkaido University Sapporo 060, Japan
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1995

Citing 3
Cited 2

A two-moment approximation for the mean waiting time in the GI/G/s queue

Management Science
An interpolation approximation for queueing systems with Poisson input

Operations Research
Maximum entropy two-station cyclic queues with multiple general servers

Acta Informatica

Systems with multiple servers under heavy-tailed workloads

Performance Evaluation - Performance 2005
Determining the Proper Number and Price of Software Licenses

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.98

Visualization

Abstract

This paper develops approximations for the delay probability in an M/G/s queue. For M/G/s queues, it has been well known that the delay probability in the M/M/s queue, i.e., the Erlang delay formula, is usually a good approximation for other service-time distributions. By using an excellent approximation for the mean waiting time in the M/G/s queue, we provide more accurate approximations of the delay probability for small values of s. To test the quality of our approximations, we compare them with the exact value and the Erlang delay formula for some particular cases.