Erlang's formula: the blocking probability of a link with circuits
ProvedKellyStochasticNetworks.erlang_formulaA telephone link has parallel circuits. Calls arrive as a Poisson process of rate ; each call holds one circuit for an exponentially distributed time of parameter , independently of the other calls and of the arrival process; a call that finds every circuit busy is lost. Let be the number of busy circuits, a Markov process on with transition rates
Let satisfy the detailed balance equations for these rates and be normalized, . Then the equilibrium probability that all circuits are busy is
This is Erlang's formula, equation (1.5) of Kelly and Yudovina, Stochastic Networks. It is the blocking probability of the link: by the PASTA property, Poisson arrivals see time averages, so is also the probability that an arriving call is lost. It is the quantity a network operator dimensions against, and the building block from which the loss networks of Chapter 3 are assembled.
Formalization Note The blocking state is the last element of the index type Fin (C + 1).
The hypothesis is detailed balance rather than the equilibrium equations, matching the book's
derivation; detailed balance is the stronger of the two.
import Mathlib import Definitions.Def_KellyStochasticNetworks_Balance import Definitions.Def_KellyStochasticNetworks_Erlang
namespace KellyStochasticNetworks
theorem erlang_formula (lam mu : ℝ) (C : ℕ) (hlam : 0 < lam) (hmu : 0 < mu)
(π : Fin (C + 1) → ℝ) (h : DetailedBalance π (erlangRates lam mu C))
(hsum : ∑ j, π j = 1) :
π (Fin.last C) = erlang (lam / mu) C := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.