Queue Dynamics
Little's Law: L = λ × W · Erlang 1909 · What happens when arrivals outpace service?
Utilization ρ
—
λ / μ
Queue Length L
—
items
Wait Time W
—
seconds
Items Lost
0
dropped (L > 200)
Adjust arrival rate λ and service rate μ to observe queue behavior. When ρ < 1: system is stable. When ρ ≥ 1: queue grows without bound.
Queue Animation
Queue Length Over Time
Parameters
Arrival rate λ (items/sec)
2.0
Service rate μ (items/sec)
3.0
Reset Queue
Pause
Stable (λ=2, μ=3)
Edge (λ=5, μ=5)
Overloaded (λ=7, μ=4)
Fast drain (λ=1, μ=8)