Eq. (2.33) — the expected queue length L_q of the M/M/c queue
ProvedQueueingFundamentals.BirthDeath.mmc_queue_lengthmmcp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueing
In the queue with , , and , let be the steady-state solution. Then the expected number waiting in queue,
is a convergent series with value
Together with Little's formula this gives , and of the queue, (2.34)–(2.36).
Formalization Note The statement asserts that the series converges to the displayed value (HasSum), so it cannot hold by a junk value of an infinite sum.
Preamble
import Mathlib import Definitions.Def_QueueingFundamentals_BirthDeath_Balance
Formal statement
namespace QueueingFundamentals.BirthDeath
/-- Eq. (2.33), p.68. In the steady state of the `M/M/c` queue with `ρ = λ/(cμ) < 1`, the expected
queue length `L_q = ∑_{n=c+1}^{∞} (n − c) p_n` is finite and equals `(r^c ρ / (c!(1 − ρ)^2)) p_0`,
where `r = λ/μ`. -/
theorem mmc_queue_length (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) :
HasSum (fun n : ℕ => if c + 1 ≤ n then ((n : ℝ) - c) * p n else 0)
(r ^ c * ρ / ((c.factorial : ℝ) * (1 - ρ) ^ 2) * p 0) := by sorry
end QueueingFundamentals.BirthDeath
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.68, Eq. (2.33)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.