Approximate solution of closed queueing networks using mathematical formulae

A practical method which gives the approximate solution of product form closed queueing networks is developed. The starting point is the integral representation of the normalization constant G. This approach was first used by Mitra et al. (1982). A conceptually simpler solution is proposed. It follows that the memory space requirements are dramatically reduced and the processing time is quite small, even on eight-bit personal computers. An important feature of this approach is that the complexity does not grow with the number of chains (classes), but only with the number of noninfinite server stations.<>