Eq. (7.7) —
ProvedQueueingFundamentals.Bounds.mean_wait_formulaConsider a G/G/1 queue whose interarrival time and service time are nonnegative, have finite second moments, and satisfy and with and . Let be a stationary law of the line delay under Lindley's recursion (7.1), let , and let with , and independent.
Then the stationary line delay has a finite mean , and
This expresses the mean wait of a stable G/G/1 queue through second moments of and of the idle gap . The upper bound (7.13) and the lower bound (7.14) are both read off from it.
Formalization Note The finiteness of is part of the conclusion, not a hypothesis. No finite second moment of the stationary wait is assumed, although the book's derivation squares (7.3). , so the denominator is nonzero.
import Mathlib import Definitions.Def_QueueingFundamentals_Bounds_GG1
namespace QueueingFundamentals.Bounds
open MeasureTheory ProbabilityTheory Filter Topology
/-- Eq. (7.7), p.331. For a stationary G/G/1 queue with `ρ < 1`, the stationary line delay has
finite mean `W_q = E[W_q^{(n)}]` and `W_q = (E[X²] − E[U²]) / (2E[U])`. -/
theorem mean_wait_formula
{A B ν : Measure ℝ} {lam mu : ℝ} (hlam : 0 < lam) (hmu : 0 < mu)
(hin : IsGG1Input A B lam mu) (hrho : lam / mu < 1) (hν : IsStationaryWaitLaw A B ν) :
Integrable (fun w : ℝ => w) ν ∧
meanWait ν =
(∫ p, idleX p.1 p.2.1 p.2.2 ^ 2 ∂(stepLaw ν B A) - ∫ p, (p.2.1 - p.2.2) ^ 2 ∂(stepLaw ν B A)) /
(2 * ∫ p, (p.2.1 - p.2.2) ∂(stepLaw ν B A)) := by sorry
end QueueingFundamentals.Bounds
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.