§A.2, p. 213 — fluid limits satisfy equations (14)–(18)
ProvedMaxPressure.Throughput.fluid_limit_equationsfluid-limitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-processing-network
Fix a network with the standing assumptions of §2, including positive processing-time means . On a sample path where the processing-time and routing laws of large numbers (3)–(4) hold, suppose its network paths satisfy the stochastic network equations (39)–(43). If the positively scaled paths have a fluid limit uniformly on compact time intervals, then
This identifies the equations obeyed by every fluid limit used in Theorem 3 and Lemma 4. The original initial buffer contents need not vanish: scaling sends a fixed initial state to zero.
Preamble
import Mathlib import Definitions.Def_MaxPressure_Throughput_Dynamics
Formal statement
namespace MaxPressure.Throughput
/-- Appendix A.2, p. 213: a fluid limit of (39)–(43) solves (14)–(18)
and starts with zero buffer levels. -/
theorem fluid_limit_equations {I J K : ℕ} {Ω : Type*}
(N : Network I J K) (hN : N.Standing) (P : Primitives I J Ω)
(Z : Ω → ℝ → Fin I → ℝ) (T : Ω → ℝ → Fin J → ℝ)
(ω : Ω)
(heq : NetworkEquations N P Z T ω)
(Zb : ℝ → Fin I → ℝ) (Tb : ℝ → Fin J → ℝ)
(hlim : IsFluidLimit N P Z T ω Zb Tb) :
IsFluidSolution N Zb Tb ∧ Zb 0 = 0 := by sorry
end MaxPressure.Throughput
Source
Dai & Lin, Maximum pressure policies in stochastic processing networks, Oper. Res. 53(2) (2005), p. 213, §A.2, paragraph following (47); https://doi.org/10.1287/opre.1040.0170
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.