Performance Evaluation of Closed Tandem Queueing Networks with Finite Buffers

Abstract In this paper we propose a new approximation method for the analysis of closed tandem queueing networks with general service times and blocking-after-service. The principle of the method is to decompose the original network consisting of M servers into a set of M subsystems, each subsystem consisting of two servers separated by a finite buffer. In order to determine the distributions of the service times of the two servers of each subsystem, we express relationships among distributions pertaining to the different subsystems. We then propose to use a two-moment approximation. The population constraint of the closed network is taken into account by prescribing that the sum of the average buffer sizes of the subsystems is equal to the number of the customers of the network. We end up with a set of equations that characterize the unknown parameters of the service time distributions of the servers of the subsystems. An iterative procedure is then used to determine these unknown parameters. Numerical results show that the new method is quite accurate.

[1]  Yves Dallery,et al.  Analysis of Cyclic Queueing Networks with Finite Buffers and Blocking Before Service , 1989, Perform. Evaluation.

[2]  Tayfur Altiok,et al.  Analysis of production lines with general service times and finite buffers: A two-node decomposition approach , 1989 .

[3]  Raymond A. Marie,et al.  Calculating equilibrium probabilities for λ(n)/Ck/1/N queues , 1980, Performance.

[4]  Harry G. Perros,et al.  On equivalencies of blocking mechanisms in queueing networks with blocking , 1986 .

[5]  Rajan Suri,et al.  A variable buffer-size model and its use in analyzing closed queueing networks with blocking , 1986 .

[6]  W. Whitt,et al.  Open and closed models for networks of queues , 1984, AT&T Bell Laboratories Technical Journal.

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

[8]  Armand M. Makowski,et al.  An Approximation Method for General Tandem Queueing Systems Subject to Blocking , 1987 .

[9]  Yves Dallery,et al.  On Decomposition Methods for Tandem Queueing Networks with Blocking , 1993, Oper. Res..

[10]  Ian F. Akyildiz,et al.  General Closed Queueing Networks with Blocking , 1987, Performance.

[11]  Jean-Jacques Pierrat.  Modélisation de systèmes à évènements discrets sujets à des pannes , 1987 .

[12]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

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

[14]  T. Altiok.  On the Phase-Type Approximations of General Distributions , 1985 .

[15]  Ian F. Akyildiz,et al.  On the Exact and Approximate Throughput Analysis of Closed Queueing Networks with Blocking , 1988, IEEE Trans. Software Eng..

[16]  Hideaki Takagi,et al.  Stochastic Analysis of Computer and Communication Systems , 1990 .

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