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

DOI

10.1287/opre.29.3.567

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.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

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