Some light-traffic and heavy-traffic results for the GI/G/n/0 queue using the GM Heuristic

Authors:
J. B. Atkinson;I. N. Kovalenko
Affiliations:
STORM Research Centre, London Metropolitan University, London, UK N 78 DB;V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2010

Citing 3
Cited 1

An interpolation approximation for the mean workload in a GI/G/1 queue

Operations Research
Conditions for the Light-Traffic Insensitivity to Loss Probability in a GI/G/m/0 Queueing System

Cybernetics and Systems Analysis
Three Cases of Light-Traffic Insensitivity of the Loss Probability in a GI/G/m/0 Loss System to the Shape of the Service Time Distribution

Queueing Systems: Theory and Applications

A review of my scientific publications. Masters and coworkers

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we carry out both light-traffic and heavy-traffic analyses for the calculation of steady-state loss probabilities in the general multi-server queuing loss system, the GI/G/n/0 queue. The analysis makes use of a heuristic approach called the GM Heuristic, for which a detailed analysis in normal traffic has previously been published. Sufficient conditions are given for the GM Heuristic to be asymptotically exact in light traffic. The heuristic is also shown to be asymptotically exact in heavy-traffic when the number of servers n tends to infinity. These results are illustrated numerically using two-phase Coxian distributions for both the inter-arrival time and service time.