= Cyclic substitution for the Erlang fixed point
Update one link blocking probability at a time using the reduced load accepted by all other links, then cycle through the links. In logarithmic acceptance coordinates this is exact <coordinate descent> for the <convex potential for the Erlang fixed point>. Potential values decrease within a compact sublevel set. Continuity of a whole-sweep update forces every limit point to minimize every coordinate, hence to equal the unique global minimizer. This proves convergence without requiring a simultaneous substitution scheme.
Back to article page
