A simple and quick approximation algorithm for tandem, split and merge queueing networks with blocking

A simple and quick approximation algorithm for the analysis of tandem, split and merge queueing networks with general arrival and service processes with blocking is presented. The algorithm gives good estimates of the average sojourn time through the network for moderate and havey traffic. This approximation is a very valuable tool for cases where computational time is very important, especially in optimization procedures. It is also very useful for the analysis of general split and merge systems consisting of more than three nodes.