An Approximation Method for Open Restricted Queueing Networks

This paper presents an approximation method for analyzing open restricted queueing networks with exponential service time and Poisson arrivals. Analysis is made by node-by-node decomposition through the introduction of a pseudo-arrival rate and an effective service rate. The method is applied to example networks and evaluated by comparing the results obtained thereby with those by simulations or exact calculations. We find that this method provides a fairly good approximation procedure for obtaining system performance measures such as blocking probabilities, output rates, etc., in open restricted queueing networks.