Networks of Quasi-Reversible Nodes

Abstract

Many analytical results are available for a network of queues when the nodes in the network have a simplifying property. This property, called here quasi-reversibility, was first identified by Muntz and has since been investigated by a number of authors. A closely related concept, partial balance, has been central to the investigation of insensitivity begun by Matthes. Here we describe the concept of quasi-reversibility, provide new examples of quasi-reversible nodes, discuss the range of arrival rates for which a node remains quasi-reversible, and analyse a model of a communication network insensitive to patterns of dependence more general than have previously been considered.

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

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