Equation (3.3) — the exact equilibrium distribution of a loss network
ProvedKellyStochasticNetworks.loss_network_equilibriumA loss network with fixed routing has links, link carrying circuits, and routes; a call on route requires circuits from link and is lost if any link has fewer free. Calls on route arrive as a Poisson process of rate and hold their circuits for an exponentially distributed time of unit mean. The feasible states are .
The process is the uncapacitated network — independent Poisson streams — truncated to , so by Lemma 3.4 its equilibrium distribution is
equation (3.3). Precisely: satisfies the detailed balance equations for the truncated rates, and sums to over .
In words, the equilibrium law of a loss network is that of independent Poisson random variables conditioned on the linear inequalities . This is exact, not an approximation. It is also not directly useful for a large or complex network: computing is a sum over the feasible states, and for a general non-negative integer matrix it is NP-hard, which is why the rest of the chapter develops the Erlang fixed point approximation.
Formalization Note The truncated process lives on the subtype of feasible states, so a transition that would leave has no target and is suppressed automatically. Following the book, is the reciprocal of the sum of the weights, so the summability hypothesis is stated for ; it asserts convergence and the value at once.
import Mathlib import Definitions.Def_KellyStochasticNetworks_Balance import Definitions.Def_KellyStochasticNetworks_Erlang import Definitions.Def_KellyStochasticNetworks_Migration import Definitions.Def_KellyStochasticNetworks_LossNetwork
namespace KellyStochasticNetworks
theorem loss_network_equilibrium {J R : ℕ} (A : Fin J → Fin R → ℕ) (C : Fin J → ℕ)
(ν : Fin R → ℝ) (hν : ∀ r, 0 < ν r) (G : ℝ) (hG0 : G ≠ 0)
(hG : HasSum (fun n : lossStates A C => lossWeight ν (n : Fin R → ℕ)) G⁻¹) :
DetailedBalance (fun n : lossStates A C => G * lossWeight ν (n : Fin R → ℕ))
(truncatedRates
(openMigrationRates (fun _ _ => (0 : ℝ)) (fun _ => 1) ν (fun _ m => (m : ℝ)))
(lossStates A C))
∧ HasSum (fun n : lossStates A C => G * lossWeight ν (n : Fin R → ℕ)) 1 := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.