In queueing theory, a discipline within the mathematical theory of probability, a Jackson network (sometimes Jacksonian network) is a class of queueing network where the equilibrium distribution is particularly simple to compute as the network has a product-form solution. It was the first significant development in the theory of networks of queues, and generalising and applying the ideas of the theorem to search for similar product-form solutions in other networks has been the subject of much research, including ideas used in the development of the Internet. The networks were first identified by James R. Jackson and his paper was re-printed in the journal Management Science’s ‘Ten Most Influential Titles of Management Sciences First Fifty Years.’
Jackson was inspired by the work of Burke and Reich, though Jean Walrand notes "product-form results … [are] a much less immediate result of the output theorem than Jackson himself appeared to believe in his fundamental paper".
An earlier product-form solution was found by R. R. P. Jackson for tandem queues (a finite chain of queues where each customer must visit each queue in order) and cyclic networks (a loop of queues where each customer must visit each queue in order).
A Jackson network consists of a number of nodes, where each node represents a queue in which the service rate can be both node-dependent (different nodes have different service rates) and state-dependent (service rates change depending on queue lengths). Jobs travel among the nodes following a fixed routing matrix. All jobs at each node belong to a single "class" and jobs follow the same service-time distribution and the same routing mechanism. Consequently, there is no notion of priority in serving the jobs: all jobs at each node are served on a first-come, first-served basis.
Jackson networks where a finite population of jobs travel around a closed network also have a product-form solution described by the Gordon–Newell theorem.
a customer completing service at queue i will either move to some new queue j with probability or leave the system with probability , which, for an open network, is non-zero for some subset of the queues,
In an open Jackson network of mM/M/1 queues where the utilization is less than 1 at every queue, the equilibrium state probability distribution exists and for state is given by the product of the individual queue equilibrium distributions
The result also holds for M/M/c model stations with ci servers at the station, with utilization requirement .
In an open network, jobs arrive from outside following a Poisson process with rate . Each arrival is independently routed to node j with probability and . Upon service completion at node i, a job may go to another node j with probability or leave the network with probability .
Hence we have the overall arrival rate to node i, , including both external arrivals and internal transitions:
(Since the utilisation at each node is less than 1, and we are looking at the equilibrium distribution i.e. the long-run-average behaviour, the rate of jobs transitioning from j to i is bounded by a fraction of the arrival rate at j and we ignore the service rate in the above.)
Define , then we can solve .
All jobs leave each node also following Poisson process, and define as the service rate of node i when there are jobs at node i.
Let denote the number of jobs at node i at time t, and . Then the equilibrium distribution of , is determined by the following system of balance equations:
Under some mild conditions the queue-length process[clarification needed] of an open generalized Jackson network can be approximated by a reflected Brownian motion defined as , where is the drift of the process, is the covariance matrix, and is the reflection matrix. This is a two-order approximation obtained by relation between general Jackson network with homogeneous fluid network and reflected Brownian motion.
The parameters of the reflected Brownian process is specified as follows:
where the symbols are defined as:
Definitions of symbols in the approximation formula
a J-vector specifying the arrival rates to each node.
a J-vector specifying the service rates of each node.
effective arrival of node.
variation of service time at node.
variation of inter-arrival time at node.
coefficients to specify correlation between nodes.
They are defined in this way: Let be the arrival process of the system, then in distribution, where is a driftless Brownian process with covariate matrix , with , for any