Buzen's algorithm: Difference between revisions

Revision as of 17:59, 25 April 2007

Revision as of 00:37, 12 May 2007

Line 1:

{{Verify}}

==Buzen's algorithm==

'''Buzen's algorithm''' is an algorithm related to [[queueing theory]] used to calculate the [[normalization constant]] <math>G(N)</math> for a [[closed network|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.<ref name="buzen-1973">{{cite journal

| first = Jeffrey

Line 16 ⟶ 15:

The motivation for this algorithm is the result of the combinatorial explosion of the number of states that the system can be in.

===Derivation===

<math>G(N) = g(M, N)</math>

Line 59 ⟶ 58:

This simpler recursive relationship allows for the calculation of all <math>G(n)</math> up to any value of N to be found in order <math>O(MN)</math> time.

===Implementation===

===References===

<references/>