Jackson's theorem (queueing theory): Difference between revisions

Revision as of 22:10, 10 December 2005

Revision as of 22:11, 10 December 2005

Line 1:

{{moveto|Jackson's theorem}}

'''Jackson's Theoremtheorem''' is the first significant development in the theory of [[queueing theory|networks of queues]]. It assumes an open queueing

network of single-server queues with the following characteristics:

Line 13:

* Arrivals from the outside world are Poisson. All queues have exponential service time distributions.

==Production form of Jackson's Networknetwork==

<math>P(k_1,k_2,...,k_M)=\prod_{i=1\to M}[(\frac{\lambda_i}{\mu_i})^{k_i}(1-\frac{\lambda_i}{\mu_i})]=\prod_{i=1\to M}[(1-\rho_i)\rho_i^{k_i}]</math><br>

(where <math>\rho_i=\frac{\lambda_i}{\mu_i}</math>)

==See also==

*[[Jackson Networknetwork]]

==External links==