šŸŽ« Queueing Theory — 2D M/M/c

Canvas2D companion
Queue length over time — blue = live, yellow dashed = theoretical L

Controls

Live HUD

Utilisation ρ—
Theoretical L—
Theoretical W—
Empirical avg L—
Empirical avg W—
Current queue size—
Servers busy—
Served / lost—
Arrivals follow a Poisson process (exponential inter-arrival times, rate Ī»). Each of the c servers has an independent exponential service time at rate μ. Stable only when ρ = Ī»/(cμ) < 1 — Erlang-C theory (yellow) is compared live against the running simulation (blue).
Poisson arrivalsExponential serviceErlang-C