Remark 5.14 — positive recurrence needs , strictly below
ProvedKellyStochasticNetworks.ack_positive_recurrence_gapA balance argument bounds the arrival rate at which an acknowledgement-based scheme can be positive recurrent. In equilibrium the expected number of packets transmitted per slot must equal the expected number arriving, and the former is at most , so a positive recurrent system requires
Two consequences are asserted.
- Any with satisfies . (The exact threshold is the solution of , the omega constant .)
- .
Together these say that the interval is non-empty and that on it an acknowledgement-based scheme cannot be positive recurrent — even though Ethernet, whose critical rate is , does transmit infinitely many packets there. "Infinitely many packets get through" is strictly weaker than "the backlog is stable", and this is the gap between them.
Formalization Note The balance argument that produces the hypothesis is a statement about an equilibrium distribution of the backlog chain and is not formalized here; what is asserted is the numerical consequence drawn from it, together with the comparison against that makes the gap non-empty.
import Mathlib import Definitions.Def_KellyStochasticNetworks_RandomAccess
namespace KellyStochasticNetworks
theorem ack_positive_recurrence_gap :
(∀ ν : ℝ, 0 < ν → ν ≤ Real.exp (-ν) → ν < 0.5672)
∧ (0.5672 : ℝ) < Real.log 2 := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.