Characterizations of Poisson traffic streams in Jackson queueing networks

Abstract

The equilibrium behavior of Jackson queueing networks (Poisson arrivals, exponential servers and Bernoulli switches) has recently been investigated in some detail. In particular, it was found that in equilibrium, the traffic processes on the so-called exit arcs of a Jackson network with single server nodes constitute Poisson processes—a result extending Burke's theorem from single queues to networks of queues. A conjecture made by Burke and others contends that the traffic processes on non-exit arcs cannot be Poisson in equilibrium. This paper proves this conjecture to be true for a variety of Jackson networks with single server nodes. Subsequently, a number of characterizations of the equilibrium traffic streams on the arcs of open Jackson networks emerge, whereby Poisson-related stochastic properties of traffic streams are shown to be equivalent to a simple graph-theoretical property of the underlying arcs. These results then help to identify some inherent limitations on the feasibility of equilibrium decompositions of Jackson networks, and to point out conditions under which further decompositions are ‘approximately’ valid.