Heavy-traffic limits for queues with many exponential servers

Halfin, S., & Whitt, W. (1981). Heavy-traffic limits for queues with many exponential servers. Operations Research, 29(3), 567-588.

Type

Journal article

Intellectual base

Primary research

Year

1981

Volume

29

Issue

3

Pages

567-588

DOI

10.1287/opre.29.3.567

DOI registrant

Institute for Operations Research and the Management Sciences

Link

https://doi.org/10.1287/opre.29.3.567

Cited from

operations_research

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Queueing
  • Density-pass revision integrates 15 canonical sources spanning Erlang's telephone- traffic foundations (1909, 1917) through Whitt's modern heavy-traffic asymptotics (including the Halfin-Whitt 1981 many-server regime

    This sourceEstablishes the Halfin-Whitt (QED) many-server heavy-traffic regime, extending heavy-traffic asymptotics to systems with a large number of servers.

    Supported in partVerified against the publisher's abstract

    The Halfin-Whitt 1981 abstract describes the QED many-server regime with arrival rates and servers growing while all-servers-busy probability stays fixed, backing only the sub-clause it is named for, not the count or span.

    “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 …”

    Read by an automated reader; not a human review. How support was checked

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:482933f2a3cf · see in the full table