Eq. (5.34) — the Pollaczek–Khintchine transform of the line wait
ProvedQueueingFundamentals.MG1.queue_wait_lstlaplace-stieltjes-transformm-g-1p2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1pollaczek-khintchinequeueing
Under the hypotheses of (5.33), let also be a probability distribution on (the FCFS line-wait distribution) with , the convolution expressing with and independent. Then for every real ,
Expanding this as a geometric series gives the book's representation (5.35) of through the residual-service distribution.
Preamble
import Mathlib import Definitions.Def_QueueingFundamentals_MG1_embeddedChain import Definitions.Def_QueueingFundamentals_MG1_transforms
Formal statement
namespace QueueingFundamentals.MG1
open MeasureTheory
/-- Eq. (5.34), p.237. Under the hypotheses of (5.33), let `W_q` be a probability distribution on
`[0, ∞)` (the FCFS line-wait distribution) with `W = W_q * B`, the convolution expressing
`T = T_q + S` with `T_q` and `S` independent. Then for every real `s > 0`,
`W_q*(s) = (1 - ρ) s / (s - λ[1 - B*(s)])`. -/
theorem queue_wait_lst (lam : ℝ) (hlam : 0 < lam) (B : Measure ℝ) [IsProbabilityMeasure B]
(hB : B (Set.Iio 0) = 0)
(hint : Integrable (fun t : ℝ => t) B) (hρ : utilization lam B < 1)
(π : ℕ → ℝ) (hπ : IsStationaryDist (transitionMatrix lam B) π)
(W : Measure ℝ) [IsProbabilityMeasure W] (hW : W (Set.Iio 0) = 0)
(hπW : ∀ n : ℕ, π n = ∫ t, (lam * t) ^ n * Real.exp (-(lam * t)) / (Nat.factorial n : ℝ) ∂W)
(Wq : Measure ℝ) [IsProbabilityMeasure Wq] (hWq : Wq (Set.Iio 0) = 0)
(hconv : W = Wq.conv B) :
∀ s : ℝ, 0 < s →
lst Wq s = (1 - (utilization lam B : ℂ)) * s / (s - lam * (1 - lst B s)) := by sorry
end QueueingFundamentals.MG1
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.237, Eq. (5.34)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.