Buzen's algorithm: Difference between revisions

Revision as of 15:27, 20 March 2006

Revision as of 17:41, 21 March 2006

Line 1:

==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]]. It was first proposed by [[Jeffery P. Buzen]] in 1973.<ref name="buzen-1973">{{cite journal

First proposed by [[Jeffery P. Buzen]] in 1973.<ref name="buzen-1973">{{cite journal

| first = Jeffrey

| last = Buzen

Line 14 ⟶ 12:

}}</ref>

===Derivation===

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

Line 55 ⟶ 54:

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===