Stochastic Discrete Flow Networks: Diffusion Approximations and Bottlenecks

Abstract

Diffusion approximations for stochastic congested networks, both open and closed, are described in terms of the networks' bottlenecks. The approximations arise as limits of functional central limit theorems. The limits are driven by reflected Brownian motions on the nonnegative orthant (for open networks) and on the simplex (for closed ones). The results provide, in particular, invariance principles for Jackson's open queueing networks, Gordon and Newell's closed networks and some of Spitzer's finite particle systems with zero-range interaction.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 152 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.