Buzen's algorithm: Difference between revisions

Revision as of 19:29, 28 May 2008

Revision as of 11:18, 2 February 2009

Line 1:

{{Refimprove|date=July 2007}}

In [[queueing theory]], a discipline within the mathematical [[probability theory|theory of probability]], '''Buzen's algorithm''' is an algorithm related tofor [[queueing theory]] used to calculatecalculating the [[normalization constant]] <math>G(NK)</math> forin athe [[closedGordon–Newell network|closedtheorem]] [[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

| last = Buzen

| authorlink = Jeffrey LP. Buzen

| year = 1973

| month = September

Line 12:

| issue = 9

| doi = 10.1145/362342.362345

}} [http://www-unix.ecs.umass.edu/~krishna/ece673/buzen.pdf]</ref> [[Mean-value analysis]] is an alternative algorithm that can also be used to derive performance measures without having to directly compute the normalization constant.

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

Line 61:

==Implementation==

==References==

<references/>

{{reflist}}

{{probability-stub}}

[[Category:Stochastic processes]]

[[Category:Mathematical theorems]]

[[Category:Queueing theory]]