Buzen's algorithm

This is an old revision of this page, as edited by John Reed Riley (talk | contribs) at 19:42, 11 November 2006 (moved Talk:Queueing Theory to Buzen's algorithm: I haven't had time to finish this, and likely won't, so I'm moving over everything that's here so far.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Buzen's algorithm

Buzen's algorithm is an algorithm related to queueing theory used to calculate the normalization constant   for a 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.[1]

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

Derivation

 

   
 
 
 

  to avoid affecting the product.

 

This recursive relationship allows for the calculation of all   up to any value of N in order   time.

There is a more efficent algorithm for finding   for some network. If it is assumed that  , then the recursive relationship can be simplified as follows:

   
 
 
 

This simpler recursive relationship allows for the calculation of all   up to any value of N to be found in order   time.

Implementation

References

  1. ^ Buzen, Jeffrey (1973). "Computational algorithms for closed queueing networks with exponential servers". Communications of the ACM. 16 (9). {{cite journal}}: Unknown parameter |month= ignored (help) [1]

(Confirm and expand references?)