Jackson network

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In queueing theory, a discipline within the mathematical theory of probability, a Jackson network (sometimes Jacksonian network[1]) 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,[2] including ideas used in the development of the Internet.[3] The networks were first identified by James R. Jackson[4][5] and his paper was re-printed in the journal Management Science’s ‘Ten Most Influential Titles of Management Sciences First Fifty Years.’[6]

Jackson was inspired by the work of Burke and Reich,[7] 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".[8]

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).[9]

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.[10]

Necessary conditions for a Jackson network[edit]

A network of m interconnected queues is known as a Jackson network[11] or Jacksonian network[12] if it meets the following conditions:

  1. if the network is open, any external arrivals to node i form a Poisson process,
  2. All service times are exponentially distributed and the service discipline at all queues is first-come, first-served,
  3. 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,
  4. the utilization of all of the queues is less than one.


In an open Jackson network of m M/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:

where denote the unit vector.


Suppose a vector of independent random variables with each having a probability mass function as

where . If i.e. is well defined, then the equilibrium distribution of the open Jackson network has the following product form:

for all .⟩


It suffices to verify equation is satisfied. By the product form and formula (3), we have:

Substituting these into the right side of we get:

Then use , we have:

Substituting the above into , we have:

This can be verified by . Hence both side of are equal.⟨

This theorem extends the one shown above by allowing state-dependent service rate of each node. It relates the distribution of by a vector of independent variable .


A three-node open Jackson network

Suppose we have a three-node Jackson network shown in the graph, the coefficients are:

Then by the theorem, we can calculate:

According to the definition of , we have:

Hence the probability that there is one job at each node is:

Since the service rate here does not depend on state, the s simply follow a geometric distribution.

Generalized Jackson network[edit]

A generalized Jackson network allows renewal arrival processes that need not be Poisson processes, and independent, identically distributed non-exponential service times. In general, this network does not have a product-form stationary distribution, so approximations are sought.[13]

Brownian approximation[edit]

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
symbol Meaning
a J-vector specifying the arrival rates to each node.
a J-vector specifying the service rates of each node.
routing matrix.
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

See also[edit]


  1. ^ Walrand, J.; Varaiya, P. (1980). "Sojourn Times and the Overtaking Condition in Jacksonian Networks". Advances in Applied Probability. 12 (4): 1000–1018. doi:10.2307/1426753. JSTOR 1426753.
  2. ^ Kelly, F. P. (June 1976). "Networks of Queues". Advances in Applied Probability. 8 (2): 416–432. doi:10.2307/1425912. JSTOR 1425912.
  3. ^ Jackson, James R. (December 2004). "Comments on "Jobshop-Like Queueing Systems": The Background". Management Science. 50 (12): 1796–1802. doi:10.1287/mnsc.1040.0268. JSTOR 30046150.
  4. ^ Jackson, James R. (Oct 1963). "Jobshop-like Queueing Systems". Management Science. 10 (1): 131–142. doi:10.1287/mnsc.1040.0268. JSTOR 2627213. A version from January 1963 is available at http://www.dtic.mil/dtic/tr/fulltext/u2/296776.pdf
  5. ^ Jackson, J. R. (1957). "Networks of Waiting Lines". Operations Research. 5 (4): 518–521. doi:10.1287/opre.5.4.518. JSTOR 167249.
  6. ^ Jackson, James R. (December 2004). "Jobshop-Like Queueing Systems". Management Science. 50 (12): 1796–1802. doi:10.1287/mnsc.1040.0268. JSTOR 30046149.
  7. ^ Reich, Edgar (September 1957). "Waiting Times When Queues are in Tandem". Annals of Mathematical Statistics. 28 (3): 768. doi:10.1214/aoms/1177706889. JSTOR 2237237.
  8. ^ Walrand, Jean (November 1983). "A Probabilistic Look at Networks of Quasi-Reversible Queues". IEEE Transactions on Information Theory. 29 (6): 825. doi:10.1109/TIT.1983.1056762.
  9. ^ Jackson, R. R. P. (1995). "Book review: Queueing networks and product forms: a systems approach". IMA Journal of Management Mathematics. 6 (4): 382–384. doi:10.1093/imaman/6.4.382.
  10. ^ Gordon, W. J.; Newell, G. F. (1967). "Closed Queuing Systems with Exponential Servers". Operations Research. 15 (2): 254. doi:10.1287/opre.15.2.254. JSTOR 168557.
  11. ^ Goodman, Jonathan B.; Massey, William A. (December 1984). "The Non-Ergodic Jackson Network". Journal of Applied Probability. 21 (4): 860–869. doi:10.2307/3213702.
  12. ^ Walrand, J.; Varaiya, P. (December 1980). "Sojourn Times and the Overtaking Condition in Jacksonian Networks". Advances in Applied Probability. 12 (4): 1000–1018. doi:10.2307/1426753.
  13. ^ Chen, Hong; Yao, David D. (2001). Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization. Springer. ISBN 0-387-95166-0.