Content deleted Content added
Gareth Jones (talk | contribs) correct typo |
Gareth Jones (talk | contribs) →Algorithm description: clarify order (need to solve for X_i before using them) |
||
Line 17:
==Algorithm description==
Write g(''N'',''M'') for the normalising constant of a closed queueing network with ''N'' circulating customers and ''M'' service stations. The algorithm starts by noting solving the above relations for the ''X''<sub>''i''</sub> and then setting starting conditions<ref name="buzen-1973" />
::<math>g(0, m) = 1 \text{ for }m=1,2,\cdots,M</math>
::<math>g(n, 1) = (X_1)^n \text{ for }n=0,1,\cdots,N.</math>
::<math>g(n, m) = g(n,m-1)+X_m g(n-1,m).</math>
is used to compute a grid of values. The sought for value G(''N'') = g(''N'',''M'').<ref name="buzen-1973" />
| |||