Buzen's algorithm: Difference between revisions

Revision as of 17:52, 15 April 2009

Revision as of 15:05, 16 April 2009

Line 13:

| doi = 10.1145/362342.362345

| pages = 527

}} [http://www-unix.ecs.umass.edu/~krishna/ece673/buzen.pdf]</ref> Once ''G'' is computed the probability distributions for the network can be found. In contrast, [[Mean- value analysis]] is an alternative algorithm that can also be used to derive some performance measures (such as the mean queue lengths) without having to directly compute the normalization constant.

The motivation for this algorithm is efficiency: a straightforward Gordon-Newell calculation would require the enumeration of all states that the system can be in, resulting in a combinatorial explosion. Buzen's algorithm is of order <math>N^2</math>, making the application of the G-N theorem practical, and opening up a large class of queueing systems to accurate modeling.