Eqs. (6.10)–(6.12) — the Wiener–Hopf transform relation for the G/G/1 delay
ProvedQueueingFundamentals.GG1.wiener_hopf_transformg-g-1laplace-transformp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueingwiener-hopf
Let be a stationary delay distribution of the G/G/1 queue with interarrival law and service law , let be its CDF, the law of , and define for and for (6.10). Then
Write and for the two-sided Laplace transforms, for the Laplace–Stieltjes transforms and . For every complex with and ,
and, whenever ,
This is the transform form of Lindley's equation: it reduces the G/G/1 delay to the determination of .
Formalization Note The page does not say where the transforms converge. The strip used here, with a finite exponential moment of at (so that exists), is a labelled hypothesis; the division in (6.12) is stated only where its denominator is nonzero.
Preamble
import Mathlib import Definitions.Def_QueueingFundamentals_GG1_Lindley
Formal statement
namespace QueueingFundamentals.GG1
open MeasureTheory
/-- Eqs. (6.10)–(6.12) (pp.285–286). Let `ν` be a stationary delay distribution of the G/G/1 queue
with interarrival law `A` and service law `B`, `W_q = cdfOf ν`, `U` the law of `S − T`, and
`W_q^−` as in (6.10). Then
(6.11) `W_q^−(t) + W_q(t) = ∫_{−∞}^{t} W_q(t − x) dU(x)` for all real `t`; and for every complex
`s` in the strip `0 < Re s` where `A` has the exponential moment `∫ e^{(Re s)x} dA(x) < ∞`
(a strip the page leaves implicit), `U^*(s) = A^*(−s)B^*(s)`,
`W̄_q^−(s) + W̄_q(s) = W̄_q(s)A^*(−s)B^*(s)`, and, when `A^*(−s)B^*(s) ≠ 1`,
(6.12) `W̄_q(s) = W̄_q^−(s)/(A^*(−s)B^*(s) − 1)`, with two-sided Laplace transforms `W̄`. -/
theorem wiener_hopf_transform (A B ν : Measure ℝ) (hA : IsLifetimeLaw A) (hB : IsLifetimeLaw B)
(hν : IsStationaryDelay A B ν) :
(∀ t : ℝ, negPart (diffLaw A B) (cdfOf ν) t + cdfOf ν t =
∫ x in Set.Iic t, cdfOf ν (t - x) ∂(diffLaw A B)) ∧
∀ s : ℂ, 0 < s.re → Integrable (fun x : ℝ => Real.exp (s.re * x)) A →
QueueingFundamentals.MG1.lst (diffLaw A B) s = QueueingFundamentals.MG1.lst A (-s) * QueueingFundamentals.MG1.lst B s ∧
twoSidedLaplace (negPart (diffLaw A B) (cdfOf ν)) s + twoSidedLaplace (cdfOf ν) s =
twoSidedLaplace (cdfOf ν) s * (QueueingFundamentals.MG1.lst A (-s) * QueueingFundamentals.MG1.lst B s) ∧
(QueueingFundamentals.MG1.lst A (-s) * QueueingFundamentals.MG1.lst B s ≠ 1 →
twoSidedLaplace (cdfOf ν) s =
twoSidedLaplace (negPart (diffLaw A B) (cdfOf ν)) s / (QueueingFundamentals.MG1.lst A (-s) * QueueingFundamentals.MG1.lst B s - 1)) := by sorry
end QueueingFundamentals.GG1
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, pp.285–286, Eqs. (6.10), (6.11), U*(s) = A*(−s)B*(s) and (6.12)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.