Proposition 2.4, p. 712 — in M/D/∞ with unit service times, N(t) ~ Poisson(λ) for each t > 1
ProvedWhittEfficiency.IS.proposition_2_4infinite-serverp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poissonqueueing
Consider the M/D/∞ model: Poisson arrivals with rate (i.i.d. exponential interarrival times), infinitely many servers, and every service time equal to , the system starting empty at time . Let be the number of busy servers at time . Then for each , has a Poisson distribution with mean :
The mean and the variance of are both , which is the starting point of the paper's derivation of the square-root staffing formula .
Formalization Note The Poisson law is stated pointwise through the probability mass function. The printed condition is kept as is.
Preamble
import Mathlib import Definitions.Def_WhittEfficiency_IS_Model open MeasureTheory ProbabilityTheory QueueingFundamentals.Foundations
Formal statement
namespace WhittEfficiency.IS
/-- Whitt 1992, Proposition 2.4, p. 712: in an M/D/∞ model with service times of length `1` and
Poisson arrivals of rate `lam`, the number of busy servers `N(t)` is Poisson with mean `lam` for
each `t > 1`. -/
theorem proposition_2_4 {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
[IsProbabilityMeasure μ] (lam : ℝ) (hlam : 0 < lam) (T : ℕ → Ω → ℝ)
(hT : IsExpInterarrivals μ lam T) (t : ℝ) (ht : 1 < t) :
∀ k : ℕ, μ.real {ω | busyCount T (fun _ _ => 1) t ω = k} =
Real.exp (-lam) * lam ^ k / k.factorial := by sorry
end WhittEfficiency.IS
Source
Whitt, Understanding the efficiency of multi-server service systems, Management Sci. 38 (1992), p. 712, Proposition 2.4
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.