An operator-analytic approach to the Jackson network

Abstract

Operator methods are used in this paper to systematically analyze the behavior of the Jackson network. Here, we consider rarely treated issues such as the transient behavior, and arbitrary subnetworks of the total system. By deriving the equations that govern an arbitrary subnetwork, we can see how the mean and variance for the queue length of one node as well as the covariance for two nodes vary in time.

We can estimate the transient behavior by deriving a stochastic upper bound for the joint distribution of the network in terms of a judicious choice of independent M/M/1 queue-length processes. The bound we derive is one that cannot be derived by a sample-path ordering of the two processes. Moreover, we can stochastically bound from below the process for the total number of customers in the network by an M/M/1 system also. These results allow us to approximate the network by the known transient distribution of the M/M/1 queue. The bounds are tight asymptotically for large-time behavior when every node exceeds heavy-traffic conditions.