The tree MVA algorithm

A new algorithm to solve product form queueing networks, especially those with large numbers of centers and chains, is presented. This algorithm is a Tree version of Mean Value Analysis (MVA). Tree MVA is analogous to the Tree version of Convolution developed by Lam and Lien. Like Tree Convolution, Tree MVA allows exact solution of large networks which are intractable with previous sequential algorithms. As with the sequential versions of Convolution and MVA, Tree MVA has better numerical properties than Tree Convolution. Further, Tree MVA avoids the computational complexity of sequential MVA in networks with several queue dependent centers. Thus, we consider Tree MVA to be the best algorithm for general product form networks.