Eqs. (7.15)–(7.16) — the root of and
ProvedQueueingFundamentals.Bounds.r0_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). Let be the CDF of (, independent), and set
Then:
- has exactly one nonnegative root .
- The mean stationary line delay is finite, and
- For every real ,
and .
This lower bound uses the full distributions of and , not only their first two moments.
Formalization Note The conclusions about are stated for every nonnegative root of ; item 1 says there is exactly one. (7.15) is stated for all real . For it holds because .
Preamble
import Mathlib import Definitions.Def_QueueingFundamentals_Bounds_GG1
Formal statement
namespace QueueingFundamentals.Bounds
open MeasureTheory ProbabilityTheory Filter Topology
/-- pp.334–336, Eqs. (7.15)–(7.16). For a stationary G/G/1 queue with `ρ < 1`:
`f(z) = z − ∫_{−z}^{∞} [1 − U(t)] dt` has a unique nonnegative root `r₀`; the stationary line delay
has finite mean with `W_q ≥ f₁(W_q)` (7.16); and for that root, `f₁(z) > z` for `z < r₀` and
`f₁(z) ≤ z` for `z ≥ r₀` (7.15), and `W_q ≥ r₀`. -/
theorem r0_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 ν) :
(∃! r : ℝ, 0 ≤ r ∧ rootFun A B r = 0) ∧
Integrable (fun w : ℝ => w) ν ∧
f1 A B (meanWait ν) ≤ meanWait ν ∧
∀ r : ℝ, 0 ≤ r → rootFun A B r = 0 →
(∀ z : ℝ, (z < r → z < f1 A B z) ∧ (r ≤ z → f1 A B z ≤ z)) ∧ r ≤ meanWait ν := by sorry
end QueueingFundamentals.Bounds
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, pp.334–336, f(z), Eqs. (7.15), (7.16) and W_q ≥ r_0
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.