A probabilistic look at networks of quasi-reversible queues

Abstract

Probabilistic arguments are given to explain some recent results on networks of queues. Those results are the product form, the output theorems, the distributions at the jumps, and the Poisson character of the flows. The proposed approach replaces the usual calculations by arguments showing these properties to be consequences of the behavior of the nodes in isolation.

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 — 38 citations exist upstream.

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