§2.5, p. 713 — for t > max dᵢ, N(t) is a sum of independent Poisson(λpᵢdᵢ) class counts
ProvedWhittEfficiency.IS.sec_2_5_class_countsinfinite-serverp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poissonqueueing
In the infinite-server model with Poisson arrivals of rate and i.i.d. service times, independent of the arrivals, equal to with probability (), let be the number of busy servers occupied by class- customers at time and the total number of busy servers. If , then
- are mutually independent;
- is Poisson with mean :
- almost surely .
So the number of busy servers has the distribution of a sum of independent Poisson variables with means .
Formalization Note Part 3 holds almost surely rather than for every outcome because the counts are Set.ncard, which returns on the null event of infinitely many arrivals in a bounded window. Classes are indexed by Fin m.
Preamble
import Mathlib import Definitions.Def_WhittEfficiency_IS_Model open MeasureTheory ProbabilityTheory QueueingFundamentals.Foundations
Formal statement
namespace WhittEfficiency.IS
/-- Whitt 1992, §2.5, p. 713 (the "Hence" sentence): for `t > max d i`, the number of busy
servers is almost surely the sum over classes of the class busy counts, which are independent
Poisson variables with means `lam * p i * d i`. -/
theorem sec_2_5_class_counts {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
[IsProbabilityMeasure μ] (lam : ℝ) (hlam : 0 < lam) (T : ℕ → Ω → ℝ)
{m : ℕ} (p d : Fin m → ℝ) (hd : ∀ i, 0 ≤ d i) (J : ℕ → Ω → Fin m)
(hM : IsMarkedPoisson μ lam T p J)
(t : ℝ) (ht : ∀ i, d i < t) :
iIndepFun (fun i ω => classBusyCount T J d i t ω) μ ∧
(∀ (i : Fin m) (k : ℕ), μ.real {ω | classBusyCount T J d i t ω = k} =
Real.exp (-(lam * p i * d i)) * (lam * p i * d i) ^ k / k.factorial) ∧
∀ᵐ ω ∂μ, busyCount T (fun j ω => d (J j ω)) t ω = ∑ i, classBusyCount T J d i t ω := by sorry
end WhittEfficiency.IS
Source
Whitt, Understanding the efficiency of multi-server service systems, Management Sci. 38 (1992), p. 713, §2.5, fifth sentence ("Hence, for t > max …")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.