Revision as of 03:20, 18 April 2009 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits No edit summary ← Previous edit		Revision as of 03:20, 18 April 2009 edit undo Michael Hardy (talk \| contribs) Administrators 210,577 edits No edit summary Next edit →
Line 17: 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 ''N''<sup>2</sup>, making the application of the G-N theorem practical, and opening up a large class of queueing systems to accurate modeling. In the queuing literature Buzen's algorithm is sometimes also referred to as the '''~~Convolution~~convolution algorithm'''. ==Problem setup==

Buzen's algorithm: Difference between revisions