Approximate analysis for queueing networks with finite capacity and customer loss

An approximation procedure is proposed for the analysis of general queueing networks 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 a QNA version for handling queueing networks with blocking. The numerical examples show that the approximations compare favorably with simulation results.

[1]  Anatol Kuczura,et al.  The interrupted poisson process as an overflow process , 1973 .

[2]  J. A. Buzacott,et al.  Open queueing network models of dynamic job shops , 1981 .

[3]  S. Balasmo,et al.  Closed queueing networks with finite capacities: blocking types, product-form solution and performance indices , 1991 .

[4]  W. Whitt,et al.  Performance of the Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[5]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[6]  K. Mani Chandy,et al.  Approximate Methods for Analyzing Queueing Network Models of Computing Systems , 1978, CSUR.

[7]  R. I. Wilkinson.  Theories for toll traffic engineering in the U. S. A. , 1956 .

[8]  P. Kuehn,et al.  Approximate Analysis of General Queuing Networks by Decomposition , 1979, IEEE Trans. Commun..

[9]  Harry G. Perros,et al.  A Bibliography of Papers on Queueing Networks with Finite Capacity Queues , 1989, Perform. Evaluation.

[10]  Raif O. Onvural,et al.  A survey of closed queueing networks with finite buffers , 1987 .

[11]  Alan S. Manne,et al.  Feature Article - Energy Policy Modeling: A Survey , 1979, Oper. Res..

[12]  Harry G. Perros,et al.  Approximate analysis of arbitrary configurations of queueing networks with blocking and deadlock , 1988 .

[13]  Hisashi Kobayashi,et al.  Accuracy of the diffusion approximation for some queuing systems , 1974 .

[14]  Harry G. Perros.  Queueing networks with blocking , 1994 .

[15]  Robert B. Cooper,et al.  An Introduction To Queueing Theory , 2016 .

[16]  J. Walrand,et al.  Monotonicity of Throughput in Non-Markovian Networks. , 1989 .

[17]  Oscar Bronshtein,et al.  An open exponential queuing network with limited waiting spaces and losses: A method of approximate analysis , 1984, Perform. Evaluation.

[18]  Erol Gelenbe,et al.  Analysis and Synthesis of Computer Systems , 1980 .

[19]  Raif O. Onvural,et al.  Survey of closed queueing networks with blocking , 1990, CSUR.

[20]  Leonard Kleinrock,et al.  Queueing Systems - Vol. 1: Theory , 1975 .