The Single Server Queue in Heavy Traffic.

Kingman, J. F. C. (1961). The Single Server Queue in Heavy Traffic. Mathematical Proceedings of the Cambridge Philosophical Society, 57(4), 902-904.

Type

Journal article

Intellectual base

Primary research

Year

1961

Volume

57

Issue

4

Pages

902-904

DOI

10.1017/s0305004100036094

DOI registrant

Cambridge University Press

Link

https://doi.org/10.1017/S0305004100036094

Cited from

chemistry_materials, computer_science, operations_research

Cited by

11 citations across 11 artifacts.

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

Primes

• Buffering
  • Engineers reason about buffer utilization (what fraction of capacity is in use during typical operation?) and buffer latency (how long does material spend in the buffer?), a trade-off Kingman (1961) formalized in his heavy-traffic approximation showing that mean queue waiting time grows roughly as ρ/(1−ρ) times a variability term.
• Interference and Contention
  • A core function of "interference and contention" is to distinguish between overload and contention, a separation Kingman (1961) made tractable through his analysis of waiting times in single-server queues with arbitrary arrival processes.
• Queueing
  • Not always Markovian:

    This sourceHeavy-traffic approximation for the GI/G/1 queue, giving bounds on mean wait when exact (Markovian) solutions are unavailable.

• Unevenness Waste
  • The underlying regularity is queueing-theoretic: delay scales roughly as \(\rho\sigma^2/(1-\rho)\) for utilization \(\rho\) and variability \(\sigma\), a formula that has been independently re-derived across substrates.

    This sourceDerives the heavy-traffic approximation in which mean delay scales with the variability of arrivals and service over (1−ρ), pricing variance as a cost additive to the mean.

Mechanisms

• Capacity Utilization Dashboard
  • Pushing toward 100% as if the last points were free ignores that wait time rises sharply as utilization approaches capacity — a robust result from queueing theory, where variability makes the cliff steeper the closer you run to full.

    This sourceGives Kingman’s heavy-traffic result, in which single-server waiting time grows sharply as utilization approaches one, with arrival and service variability setting the delay scale.

• Incremental Staffing Adjustment
  • Queueing theory sharpens why increments matter: near saturation, small capacity changes have outsized effects on wait time, so a single agent can swing the queue dramatically.

    This sourceShows that expected waiting grows sharply as single-server utilization approaches saturation, so small capacity differences near heavy traffic can have large delay effects.

• Operational Capacity Simulation
  • Its strength is that it captures the capacity nonlinearity intuition gets wrong: because congestion grows explosively as utilization approaches one, small staffing or buffer changes can have outsized effects, and only a flow model reveals where on that curve a system sits.

    This sourceShows that waiting time in a single-server queue becomes large in heavy traffic as utilization approaches one.

• Queue Simulation Sweep
  • Queueing theory names this: mean waiting time rises with the variability of arrivals and service, not just their averages, which is why a deterministic optimum can be badly wrong under real burstiness.

    This sourceShows that mean queueing delay depends on arrival and service variability, not only their averages.

• Queueing Simulation
  • Its core lesson is quantified by Kingman's formula: waiting time scales with variability and rises toward infinity as utilization approaches one, so a system run "efficiently" near full capacity is one bad clump away from a runaway queue.

    This sourceDerives a single-server heavy-traffic waiting-time approximation that increases with arrival and service variability and diverges as utilization approaches one.

• Staffing Level Adjustment
  • People take time to redeploy and to ramp, so a manager who chases every spike whipsaws staff between stations and exhausts them, while a loop tuned to average load saturates the moment demand is genuinely heavy — the queueing math is unforgiving, since service degrades sharply as utilization approaches capacity.
• Utilization Ceiling Dashboard
  • (The nonlinear blow-up near full utilization is Kingman's formula.

    This sourceGives the heavy-traffic single-server approximation in which expected waiting grows in proportion to utilization divided by one minus utilization.

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? Not recorded. Neither this nor any other of the 11 citations of this work carries a recorded support check.

Was it audited? Yes. A second, independent pass read the citation against the article text and recorded a verdict.

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:ea99465f95a1 · see in the full table