Operations Research · 1981 · 771 citations · 21 references
BusinessComputer SystemsProbability TheoryQueuing TheoryStochastic ProcessesLimit TheoremsQueueing AnalysisQueueing ProcessesQueueing SystemsQueueing TheoryStochastic Service SystemsHeavy Traffic TheoryHeavy-tailed Limit TheoremsHeavy-traffic LimitsInterarrival Time DistributionsMany-server Limit TheoryNormalizationQueueing ModelsWaiting Time Distributions
Heavy‑traffic limit theorems for s‑server queues come in two forms—fixed‑server limits as traffic intensity approaches one, and infinite‑server limits with fixed intensity below one—but neither captures realistic queues where delay probability is neither zero nor one. This work investigates a new sequence of GI/M/S systems in which traffic intensity approaches one from below, arrival rates and server counts grow without bound, yet the probability that all servers are busy is held constant. The analysis models these GI/M/S queues, normalizing the steady‑state customer count to study its limiting behavior as both traffic intensity and system size diverge. The resulting hybrid limits converge to a nondegenerate distribution after normalization, blending the two classic regimes, and numerical tests show the approximation outperforms earlier many‑server limits at typical operating loads.
Two different kinds of heavy-traffic limit theorems have been proved for s-server queues. The first kind involves a sequence of queueing systems having a fixed number of servers with an associated sequence of traffic intensities that converges to the critical value of one from below. The second kind, which is often not thought of as heavy traffic, involves a sequence of queueing systems in which the associated sequences of arrival rates and numbers of servers go to infinity while the service time distributions and the traffic intensities remain fixed, with the traffic intensities being less than the critical value of one. In each case the sequence of random variables depicting the steady-state number of customers waiting or being served diverges to infinity but converges to a nondegenerate limit after appropriate normalization. However, in an important respect neither procedure adequately represents a typical queueing system in practice because in the (heavy-traffic) limit an arriving customer is either almost certain to be delayed (first procedure) or almost certain not to be delayed (second procedure). Hence, we consider a sequence of (GI/M/S) systems in which the traffic intensities converge to one from below, the arrival rates and the numbers of servers go to infinity, but the steady-state probabilities that all servers are busy are held fixed. The limits in this case are hybrids of the limits in the other two cases. Numerical comparisons indicate that the resulting approximation is better than the earlier ones for many-server systems operating at typically encountered loads.
21
An introduction to queueing theory
Computers & Operations Research · 1993 · 914 citations
Multiple channel queues in heavy traffic. I
Donald L. Iglehart, Ward Whitt · Advances in Applied Probability · 1970 · 452 citations