Buzen's algorithm
From Wikipedia, the free encyclopedia
Contents |
[edit] Buzen's algorithm
Buzen's algorithm is an algorithm related to queueing theory used to calculate the normalization constant G(N) for a closed jackson network. This constant is used when analyzing these networks, alternatively Mean-value analysis can be used to avoid having to compute the normalization constant. This method was first proposed by Jeffrey P. Buzen in 1973.[1]
The motivation for this algorithm is the result of the combinatorial explosion of the number of states that the system can be in.
[edit] Derivation
G(N) = g(M,N)
g(m,n) | |
g(m,0) = 1 to avoid affecting the product.
g(1,n) = f1(n)
This recursive relationship allows for the calculation of all G(N) up to any value of N in order O(MN2) time.
There is a more efficient algorithm for finding G(N) for some network. If it is assumed that , then the recursive relationship can be simplified as follows:
g(m,n) | |
= fm(0)g(m − 1,n) + ymg(m,n − 1) |
This simpler recursive relationship allows for the calculation of all G(n) up to any value of N to be found in order O(MN) time.
[edit] Implementation
[edit] References
- ^ Buzen, Jeffrey (September 1973). "Computational algorithms for closed queueing networks with exponential servers". Communications of the ACM 16 (9). [1]