Iterative algorithms for performance evaluation of closed network models

A number of nonlinear programming algorithms are proposed to obtain the approximate solutions for non-product form multiclass queueing network models, as well as priority queueing networks. Using sensitivity analysis, we develop an efficient iterative technique for closed queueing networks. We compare the approximate solutions obtained from our approach with the global balance solution. Examples illustrate the accuracy of the approximation, and compare the efficiency of the different optimization methods we have implemented.