Approximate analysis for queueing-networks with finite-capacity and customer loss

An approximation procedure is proposed for the analysis of general queueing networks (AGQN) with finite capacity. A customer arriving to a node with fully occupied buffer is lost. Throughput and mean waiting time are studied by this approximation procedure. The general approach is to approximately characterize the arrival processes by two parameters, and then to analyze the individual nodes separately. The two parameters, mean and variance, will be obtained by using linear (or quadratic) approximations. This method is an AGQN version for handling queueing networks with blocking. The numerical examples show that the approximations compare favorably with simulation results.