Eqs. (4.14)–(4.16) — the product-form steady state of a closed Jackson network
ProvedQueueingFundamentals.Networks.closed_product_formConsider a closed Jackson network of nodes, each with a single exponential server of rate , with customers and an irreducible routing matrix whose rows sum to one. Let be any positive solution of the traffic equations (4.16),
Then a probability distribution on the states solves the flow-balance equations (4.14) if and only if
In particular the steady-state solution exists and is unique.
This is the closed-network case of Jackson's theorem: although the node populations are dependent (they sum to ), the joint distribution has product form, and every performance measure of the network reduces to the constants .
Formalization Note The book states that (4.15) solves (4.14) (Problem 4.14) and that normalizes it; the book-wide convention that the steady-state distribution is the probability solution of the balance equations makes the uniqueness half explicit here, as an ↔. Because (4.16) fixes only up to a positive scalar (p.196), the statement holds for every positive solution; depends on the choice, the distribution does not.
import Mathlib import Definitions.Def_QueueingFundamentals_Networks_ClosedJackson
namespace QueueingFundamentals.Networks
/-- Eqs. (4.14)–(4.16), pp.196: for a closed Jackson network of `k ≥ 1` single-server nodes with
service rates `μ_i > 0`, an irreducible routing matrix `R` and any positive solution `ρ` of the
traffic equations (4.16), a distribution `p` on the `N`-customer states is a steady-state solution
of the balance equations (4.14) if and only if it is the product form (4.15) normalized by
`G(N) = ∑_{n_1+⋯+n_k=N} ρ_1^{n_1} ⋯ ρ_k^{n_k}`. -/
theorem closed_product_form {k : ℕ} [NeZero k] (mu : Fin k → ℝ) (R : Fin k → Fin k → ℝ)
(rho : Fin k → ℝ) (hmu : ∀ i, 0 < mu i) (hR : IsRoutingMatrix R) (hirr : IsIrreducible R)
(hrho : ∀ i, 0 < rho i) (htraffic : IsTrafficSolution mu R rho) (N : ℕ)
(p : (Fin k → ℕ) → ℝ) :
IsClosedSteadyState mu R N p ↔ p = productForm (fun i n => rho i ^ n) N := by sorry
end QueueingFundamentals.Networks
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.