Eq. (7.14) — Marchal's lower bound
ProvedQueueingFundamentals.Bounds.marchal_lower_boundboundsgg1p2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueing
Consider 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).
Then the mean stationary line delay is finite and
This is the lower bound of Marchal (1978), valid for every stationary G/G/1 queue with . It is positive exactly when .
Preamble
import Mathlib import Definitions.Def_QueueingFundamentals_Bounds_GG1
Formal statement
namespace QueueingFundamentals.Bounds
open MeasureTheory ProbabilityTheory Filter Topology
/-- Eq. (7.14), p.333 (Marchal's lower bound). For every stationary G/G/1 queue with
`ρ = λ/μ < 1`, the stationary line delay has finite mean and
`W_q ≥ (λ²σ_B² + ρ(ρ − 2)) / (2λ(1 − ρ))`. -/
theorem marchal_lower_bound
{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) ν ∧
(lam ^ 2 * serviceVar B + lam / mu * (lam / mu - 2)) / (2 * lam * (1 - lam / mu)) ≤
meanWait ν := by sorry
end QueueingFundamentals.Bounds
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.333, Eq. (7.14)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.