Eq. (5.61) — and
ProvedQueueingFundamentals.GM1.arrival_point_meansgm1p2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1performance-measuresqueueing
Consider the G/M/1 queue with interarrival law on of mean (), exponential service at rate , and . Let be the root of , and let be a stationary arrival-point probability vector (, ). Then the mean number in the system and the mean number in queue found by an arrival are
The superscript records that these measures are taken at arrival points only.
Formalization Note is written . Both series are asserted to converge.
Preamble
import Mathlib import Definitions.Def_QueueingFundamentals_GM1_EmbeddedChain
Formal statement
namespace QueueingFundamentals.GM1
open MeasureTheory
/-- Eq. (5.61): at arrival points, the mean number in the system is `L^{(A)} = r_0/(1 - r_0)` and the
mean number in queue is `L_q^{(A)} = r_0^2/(1 - r_0)`. -/
theorem arrival_point_means (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) :
HasSum (fun n : ℕ => (n : ℝ) * q n) (r0 / (1 - r0)) ∧
HasSum (fun n : ℕ => (n : ℝ) * q (n + 1)) (r0 ^ 2 / (1 - r0)) := 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.61)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.