Networks of quasi-reversible nodes


F.P. Kelly

In "Applied Probability-Computer Science: the Interface" Volume 1,
(Editors R.L. Disney and T.J. Ott), Birkhauser, Boston, 1982. 3-29.
With discussion by J. Walrand.

Summary

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.


Paper available as (scanned) pdf: it looks terrible on the screen, but is readable if printed.
citations