Eq. (5.62) — and
ProvedQueueingFundamentals.GM1.waiting_time_cdfgm1p2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueingwaiting-time
Consider the G/M/1 queue with interarrival law on of mean (), exponential service at rate , first-come first-served discipline, and . Let be the root of and a stationary arrival-point probability vector. Then for every the line-delay and system-waiting-time CDFs seen by arrivals (defined from as in §2.2.5) are
These are the M/M/1 formulas (2.28)–(2.29) with replaced by ; they describe the waits observed by arriving customers, not the virtual waiting time.
Preamble
import Mathlib import Definitions.Def_QueueingFundamentals_GM1_EmbeddedChain import Definitions.Def_QueueingFundamentals_GM1_WaitingTime
Formal statement
namespace QueueingFundamentals.GM1
open MeasureTheory
/-- Eq. (5.62): the FCFS line-delay and system-waiting-time CDFs seen by arrivals are
`W_q(t) = 1 - r_0 e^{-μ(1-r_0)t}` and `W(t) = 1 - e^{-μ(1-r_0)t}` for `t ≥ 0`. -/
theorem waiting_time_cdf (A : Measure ℝ) (lam mu : ℝ) (hlam : 0 < lam) (hmu : 0 < mu)
(hA : IsInterarrivalLaw A lam) (hrho : lam / mu < 1)
(r0 : ℝ) (hr0 : r0 ∈ Set.Ioo (0 : ℝ) 1) (hroot : beta A mu (r0 : ℂ) = (r0 : ℂ))
(q : ℕ → ℝ) (hq : IsArrivalPointStationary A mu q) (t : ℝ) (ht : 0 ≤ t) :
lineDelayCDF q mu t = 1 - r0 * Real.exp (-mu * (1 - r0) * t) ∧
systemWaitCDF q mu t = 1 - Real.exp (-mu * (1 - r0) * t) := by sorry
end QueueingFundamentals.GM1
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.263, Eq. (5.62)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.