This is an old revision of this page, as edited by Cyrius(talk | contribs) at 00:37, 12 May 2007(correct headings). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 00:37, 12 May 2007 by Cyrius(talk | contribs)(correct headings)
The motivation for this algorithm is the result of the combinatorial explosion of the number of states that the system can be in.
Derivation
to avoid affecting the product.
This recursive relationship allows for the calculation of all up to any value of N in order time.
There is a more efficient algorithm for finding for some network. If it is assumed that , then the recursive relationship can be simplified as follows:
This simpler recursive relationship allows for the calculation of all up to any value of N to be found in order time.
Implementation
References
^Buzen, Jeffrey (1973). "Computational algorithms for closed queueing networks with exponential servers". Communications of the ACM. 16 (9). {{cite journal}}: Unknown parameter |month= ignored (help)[1]