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

Content deleted Content added
m Theorem: "then the" --> "with"
m Theorem: rm "becomes"
Line 16:
:<math>\pi (k_1,k_2,\ldots,k_m) = \prod_{i=1}^{m} \pi_i(k_i) = \prod_{i=1}^{m} [\rho_i^{k_i} (1-\rho_i)].</math>
 
The result <math>\pi (k_1,k_2,\ldots,k_m) = \prod_{i=1}^{m} \pi_i(k_i)</math> also holds for [[M/M/c model]] stations with ''c<sub>i</sub>'' servers at the <math>i^{th}</math> station, with utilization requirement becomes <math>\rho_i < c_i</math>.
 
==Generalized Jackson network==