Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (7.13) — Kingman's bound Wq≤λ(σA2+σB2)/(2(1−ρ))W_q \le \lambda(\sigma_A^2 + \sigma_B^2)/(2(1-\rho))Wq​≤λ(σA2​+σB2​)/(2(1−ρ)) for the G/G/1 queue

Proved
QueueingFundamentals.Bounds.kingman_upper_bound

by mikedeng1 · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

boundsgg1kingmanp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueing

Consider a single-server G/G/1 queue. Its interarrival times T(n)T^{(n)}T(n) are independent and identically distributed, nonnegative, with E[T]=1/λE[T] = 1/\lambdaE[T]=1/λ and variance σA2=Var[T]\sigma_A^2 = \mathrm{Var}[T]σA2​=Var[T]. Its service times S(n)S^{(n)}S(n) are independent and identically distributed, nonnegative, with E[S]=1/μE[S] = 1/\muE[S]=1/μ and variance σB2=Var[S]\sigma_B^2 = \mathrm{Var}[S]σB2​=Var[S]. Both have finite second moments, λ,μ>0\lambda, \mu > 0λ,μ>0, the service and interarrival times are independent, and the traffic intensity satisfies

ρ=λμ<1.\rho = \frac{\lambda}{\mu} < 1.ρ=μλ​<1.

The line delays follow Lindley's recursion Wq(n+1)=max⁡(0,Wq(n)+S(n)−T(n))W_q^{(n+1)} = \max(0, W_q^{(n)} + S^{(n)} - T^{(n)})Wq(n+1)​=max(0,Wq(n)​+S(n)−T(n)). Suppose the queue is stationary: the law ν\nuν of Wq(n)W_q^{(n)}Wq(n)​ is carried unchanged by one step of the recursion.

Then the mean stationary line delay Wq=E[Wq(n)]W_q = E[W_q^{(n)}]Wq​=E[Wq(n)​] is finite and

Wq≤λ(σA2+σB2)2(1−ρ).(7.13)W_q \le \frac{\lambda(\sigma_A^2 + \sigma_B^2)}{2(1 - \rho)}. \qquad (7.13)Wq​≤2(1−ρ)λ(σA2​+σB2​)​.(7.13)

This is Kingman's upper bound. It holds for every stationary G/G/1 queue with ρ<1\rho < 1ρ<1 and uses only the first two moments of the interarrival and service times. It is the standard worst-case estimate for single-server congestion.

Formalization Note Stationarity is invariance of the law of the line delay under Lindley's recursion, with Wq(n)W_q^{(n)}Wq(n)​, S(n)S^{(n)}S(n), T(n)T^{(n)}T(n) independent. The finiteness of WqW_qWq​ is part of the conclusion. No finite second moment of the stationary wait is assumed.

Preamble
import Mathlib
import Definitions.Def_QueueingFundamentals_Bounds_GG1
Formal statement
namespace QueueingFundamentals.Bounds

open MeasureTheory ProbabilityTheory Filter Topology

/-- Eq. (7.13), p.333 (Kingman's upper bound). For every stationary G/G/1 queue with
`ρ = λ/μ < 1`, the stationary line delay has finite mean and
`W_q ≤ λ(σ_A² + σ_B²) / (2(1 − ρ))`. -/
theorem kingman_upper_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) ν ∧
    meanWait ν ≤ lam * (interarrivalVar A + serviceVar B) / (2 * (1 - lam / mu)) := 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.13)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me