(2.8), p. 9 — the system equation Q(t) = I(t) + W₀(t) + M₂(t) + A_G(t) + ∫₀ᵗ (Q(t − s) − N)⁺ dF(s) of a non-idling G/GI/N queue
ProvedReedGGN.SystemEq.system_equation_2_8Consider the queue of §2: servers, customers at time (the first in service with residual service times , the others waiting), arrivals at times with counting process , service times in order of entry into service, and waiting times (arrivals) and (initial customers ). Let be the service-time distribution, on , with tail , and the residual service-time distribution, on , with tail . Let be the number in system (2.2), and , , , the terms (2.4)–(2.6).
If the sample path is non-idling, then for every ,
This is the system equation of the queue: the number in system equals the infinite-server terms plus a convolution of the number waiting against . The paper calls it the starting point for its fluid and diffusion limits (Sections 4 and 5): written as , it is an instance of the regulator equation (3.1).
Formalization Note "Non-idling" is the identity for every , which the paper uses at the start of the proof of Proposition 2.1. The integral is over the closed interval , an atom of at included. and are probability measures on carried by ; the paper's assumption that has mean is not used and is omitted. The statement is pathwise: it holds for every realisation, so no i.i.d. assumption appears.
import Mathlib import Definitions.Def_ReedGGN_SystemEq_NonIdling
namespace ReedGGN.SystemEq
open MeasureTheory
/-- The system equation (2.8) (p. 9): for a non-idling sample path of the `G/GI/N` queue and
every `t ≥ 0`,
`Q(t) = I(t) + W₀(t) + M₂(t) + A_G(t) + ∫_0^t (Q(t − s) − N)⁺ dF(s)`,
where `F` is the service-time law `μ` (carried by `[0, ∞)`), `F₀` the residual law `μ₀`
(carried by `[0, ∞)`), and the integral is over the closed interval `[0, t]`. -/
theorem system_equation_2_8 (μ μ₀ : Measure ℝ) [IsProbabilityMeasure μ]
[IsProbabilityMeasure μ₀] (hμ : μ (Set.Iio 0) = 0) (hμ₀ : μ₀ (Set.Iio 0) = 0)
(P : SamplePath) (hP : NonIdling P) (t : ℝ) (ht : 0 ≤ t) :
(Q P t : ℝ) =
I μ μ₀ P t + W0 μ₀ P t + M2 μ P t + AG μ P t +
∫ s in Set.Icc 0 t, max ((Q P (t - s) : ℝ) - P.N) 0 ∂μ := by sorry
end ReedGGN.SystemEq
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.