Proposition 3.1, p. 720 — conditional tail and mean under the utilization equation
ProvedWhittEfficiency.MMs.proposition_3_1Let be an integer and consider a stable, steady-state queue with arrival rate , unit service rate at each server, and stationary probabilities . Let be the FCFS waiting time of an arriving customer, , and suppose the utilization equation holds. A positive wait has positive probability, and for every ,
These formulas give both the conditional tail and conditional mean of the delay under the paper's utilization scaling.
Formalization Note The stationary birth–death law uses unit service rate, and the waiting-time law is the Erlang mixture in WhittEfficiency.MMs.WaitLaw. The printed (16) omits in the exponent and the printed (17) has in place of ; both are corrected here using the preceding and following text on pp. 719–720. The positive-delay conclusion guards the conditional probabilities and means against division by zero.
import Mathlib import Definitions.Def_WhittEfficiency_MMs_WaitLaw open MeasureTheory ProbabilityTheory
namespace WhittEfficiency.MMs
/-- Whitt (1992), Proposition 3.1, p. 720, (16)–(17), with the printed omissions
corrected: the exponent in (16) includes `x`, and the denominator in (17) is `γ√s`. -/
theorem proposition_3_1
(s : ℕ) (hs : 1 ≤ s) (lam : ℝ) (hlam : 0 < lam) (hρ : lam < s)
(p : ℕ → ℝ)
(hp : QueueingFundamentals.BirthDeath.IsSteadyState
(fun _ => lam) (QueueingFundamentals.BirthDeath.mmcDeath 1 s) p)
(γ : ℝ) (h1 : (1 - lam / (s : ℝ)) * Real.sqrt s = γ) :
0 < (waitLaw s p).real (Set.Ioi (0 : ℝ)) ∧
(∀ x : ℝ, 0 ≤ x →
(waitLaw s p).real (Set.Ioi x) /
(waitLaw s p).real (Set.Ioi (0 : ℝ)) =
Real.exp (-(γ * Real.sqrt s * x))) ∧
(∫ w in Set.Ioi (0 : ℝ), w ∂(waitLaw s p)) /
(waitLaw s p).real (Set.Ioi (0 : ℝ)) = 1 / (γ * Real.sqrt s) := by sorry
end WhittEfficiency.MMs
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.