Theorem 1.11(ii) (critical traffic): infinite idle time for critical M/G/1 traffic
ProvedKyprianou.Ch01.mg1IdleCriticalapplicationskyprianou-ch01queueing-theorytheorem-subpart
In an queue with arrival rate , positive claims governed by distribution with mean , and critical traffic intensity , the total server idle time accumulated over is infinite almost surely: for every initial workload .
Preamble
import Definitions.Def_LeanLevy_Processes_CompoundPoisson import Mathlib import Definitions.Def_Kyprianou_Ch01_RiskQueueCore open MeasureTheory ProbabilityTheory Kyprianou.Ch01 Set Filter open scoped NNReal ENNReal set_option autoImplicit false universe u
Formal statement
namespace Kyprianou.Ch01
theorem mg1IdleCritical
{Ω : Type u} [MeasurableSpace Ω]
(P : Measure Ω) [IsProbabilityMeasure P]
(arrival claims : ℕ → Ω → ℝ) (rate : ℝ≥0)
(F : Measure ℝ) [IsProbabilityMeasure F]
(hd : IsCompoundPoissonDriver arrival claims rate F P)
(hrate : 0 < rate)
(mu : ℝ) (hmu : 0 < mu)
(hclaimpos : F (Set.Iic (0 : ℝ)) = 0)
(hclaimint : Integrable (fun x : ℝ => x) F)
(hmean : (∫ x, x ∂F) = mu)
(hcritical : (rate : ℝ) * mu = 1) :
∀ w : ℝ, 0 ≤ w →
(P {ω | totalIdleTime arrival claims w ω = ⊤}).toReal = 1 := by
sorry
end Kyprianou.Ch01
Source
Kyprianou (2006), Introductory Lectures on Fluctuations of Lévy Processes with Applications, Theorem 1.11(ii), p. 21.