Jackson's theorem (queueing theory)
From Wikipedia, the free encyclopedia
Jackson's theorem is the first significant development in the theory of networks of queues. It assumes an open queueing network of single-server queues with the following characteristics:
- M = # of queues in the system, not counting queue 0 which represents the outside world
- μi = service rate at queue i
- λi = total rate at which jobs arrive at queue i
- utilization of the service at queue
- ni(t) =# of jobs in queue i at time t
- = the system state at time t
- Arrivals from the outside world are Poisson. All queues have exponential service time distributions.
[edit] Product form of Jackson's network
(where )
[edit] See also
[edit] External links
- Sinclair, B. (2005, June 9). Jackson's Theorem. Connexions