Eqs. (2.37)–(2.38) — the Erlang-C probability of delay
ProvedQueueingFundamentals.BirthDeath.erlang_c_formulaerlang-cmmcp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueing
In the queue with , , and , let be the steady-state solution, and let
be the steady-state probability of at most customers in the system (the probability of zero delay in queue). Then
The Erlang-C formula is the standard measure of congestion in call-center staffing.
Formalization Note is written as the sum of the stationary probabilities of the states , which is how the book evaluates it on p.69; no waiting-time random variable is introduced.
Preamble
import Mathlib import Definitions.Def_QueueingFundamentals_BirthDeath_Balance import Definitions.Def_QueueingFundamentals_BirthDeath_Erlang
Formal statement
namespace QueueingFundamentals.BirthDeath
/-- Eqs. (2.37)–(2.38), p.69. In the steady state of the `M/M/c` queue with `r = λ/μ` and
`ρ = r/c < 1`, the probability `W_q(0) = ∑_{n=0}^{c−1} p_n` of at most `c − 1` customers in the
system equals `1 − r^c p_0 / (c!(1 − ρ))`, and its complement `1 − W_q(0)` is the Erlang-C
formula `C(c, r)`. -/
theorem erlang_c_formula (lam mu : ℝ) (c : ℕ) (r ρ : ℝ) (hlam : 0 < lam) (hmu : 0 < mu)
(hc : 1 ≤ c) (hr : r = lam / mu) (hρ : ρ = r / c) (hρ1 : ρ < 1) (p : ℕ → ℝ)
(hp : IsSteadyState (fun _ => lam) (mmcDeath mu c) p) :
∑ n ∈ Finset.range c, p n = 1 - r ^ c * p 0 / ((c.factorial : ℝ) * (1 - ρ)) ∧
1 - ∑ n ∈ Finset.range c, p n = erlangC c r := by sorry
end QueueingFundamentals.BirthDeath
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.69, Eqs. (2.37), (2.38)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.