Three nodes have integer link capacities . Calls between a node pair use either its direct link or the two-link alternative. With unrestricted instantaneous rearrangement of existing calls, counts are feasible exactly when , and . Necessity follows by counting calls crossing each node cut. For sufficiency, the inequalities allow at most one count to exceed its direct-link capacity. Divert precisely that excess to the other two links; the same inequalities ensure capacity there. The counts thus have the same feasible set as a fixed routing loss network with one virtual resource at each node, capacity equal to the sum of its two incident physical-link capacities, and each call using its two endpoint resources. With independent Poisson processes for arrivals and independent routing-independent exponential distributions for holding times, this gives the usual product-form stationary distribution of a loss network and exact Poisson arrivals see time averages blocking probabilities.
Reduced-load approximation Created 2026-10-05 Updated 2026-10-06
For unit resource requirements in a loss network, the effective offered traffic to resource is , where are approximate resource blocking probabilities. The resource being modeled is excluded from its own screening product.
Stochastic network Created 2026-10-05 Updated 2026-10-06
A stochastic network combines resource constraints, routing, and random arrivals or service requirements. Loss networks reject requests that cannot acquire all required resources; flow-level network models let ongoing transfers share capacities.
Upper-truncated Poisson distribution Created 2026-10-07 Updated 2026-10-14
A Poisson distribution of parameter conditioned to lie in . It is the occupancy law of a unit-resource loss network. Its mean is the carried load of an Erlang loss resource, . Differentiating the mean with respect to gives its variance, which is positive for and ; this proves strict monotonicity of the carried load.