A variable buffer-size model and its use in analyzing closed queueing networks with blocking

We present a model which enables efficient analysis of certain types of closed queueing networks with blocking due to limited buffer spaces. The networks analyzed are those in which the limited buffers occur in tandem subnetworks. A new model, with variable buffer-size, is introduced as a conceptual tool to model part of a tandem network with blocking, using only product-form submodels. Using this model we iteratively solve for the whole network. The technique is illustrated first for a simple system with tandem queues, and then for more complex systems. The method is compared with exact solutions or simulations, and found to be reasonably accurate. The method is easily implemented using standard software for closed queueing networks. Given the complexity of the blocking problem, our approach offers a simple and efficient alternative to exact analysis.

[1]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[2]  Y. C. Tay,et al.  Error bounds for performance prediction in queuing networks , 1985, TOCS.

[3]  Guy Pujolle,et al.  HDLC Throughput and Response Time for Bidirectional Data Flow with Nonuniform Frame Sizes , 1981, IEEE Transactions on Computers.

[4]  Ernest Koenigsberg,et al.  Twenty Five Years of Cyclic Queues and Closed Queue Networks: A Review , 1982 .

[5]  Yu-Chi Ho,et al.  A gradient technique for general buffer storage design in a production line , 1979 .

[6]  Richard Paul Wiley.  Analysis of a tandem queue model of a transfer line , 1981 .

[7]  K. G. Ramakrishnan,et al.  An overview of PANACEA, a software package for analyzing Markovian queueing networks , 1982, The Bell System Technical Journal.

[8]  Mischa Schwartz,et al.  Computer-communication network design and analysis , 1977 .

[9]  M. Reiser,et al.  A Queueing Network Analysis of Computer Communication Networks with Window Flow Control , 1979, IEEE Trans. Commun..

[10]  Jeffrey P. Buzen,et al.  Queueing Network Models of Multiprogramming , 1971, Outstanding Dissertations in the Computer Sciences.

[11]  Rajan Suri,et al.  Robustness of queuing network formulas , 1983, JACM.

[12]  Alan G. Konheim,et al.  A Queueing Model with Finite Waiting Room and Blocking , 1976, JACM.

[13]  Gordon C. Hunt,et al.  Sequential Arrays of Waiting Lines , 1956 .

[14]  Xi-Ren Cao,et al.  Perturbation analysis and optimization of queueing networks , 1983 .

[15]  Alan G. Konheim,et al.  Finite Capacity Queuing Systems with Applications in Computer Modeling , 1978, SIAM J. Comput..

[16]  J. A. Buzacott,et al.  AUTOMATIC TRANSFER LINES WITH BUFFER STOCKS , 1967 .

[17]  S. Gershwin.  An efficient decomposition method for the approximate evaluation of production lines with finite storage space - Summary , 1984, The 23rd IEEE Conference on Decision and Control.

[18]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[19]  Hisashi Kobayashi,et al.  Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms , 1975, IBM J. Res. Dev..

[20]  Peter C. Bell,et al.  The use of decomposition techniques for the analysis of open restricted queuing networks , 1982, Oper. Res. Lett..

[21]  Edward D. Lazowska,et al.  Quantitative system performance - computer system analysis using queueing network models , 1983, Int. CMG Conference.

[22]  Robert E. Kahn,et al.  Flow control in a resource-sharing computer network , 1972, IEEE Trans. Commun..

[23]  Yu-Chi Ho,et al.  Optimization of large multiclass (non-product. form queueing networks using perturbation analysis , 1984 .

[24]  Tayfur M. Altiok,et al.  Approximate analysis of exponential tandem queues with blocking , 1982 .

[25]  Shaler Stidham,et al.  A Note On Transfer Lines With Unreliable Machines, Random Processing Times, and Finite Buffers , 1982 .

[26]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[27]  Frederick S. Hillier,et al.  Finite Queues in Series with Exponential or Erlang Service Times - A Numerical Approach , 1966, Oper. Res..

[28]  K. Mani Chandy,et al.  Approximate Analysis of General Queuing Networks , 1975, IBM J. Res. Dev..

[29]  B. Avi-Itzhak,et al.  A Sequence of Two Servers with No Intermediate Queue , 1965 .

[30]  David D. Yao,et al.  Modeling a Class of Flexible Manufacturing Systems with Reversible Routing , 1987, Oper. Res..

[31]  K. Mani Chandy,et al.  Computer Systems Performance Modeling , 1981 .

[32]  Stanley B. Gershwin,et al.  Modeling and Analysis of Three-Stage Transfer Lines with Unreliable Machines and Finite Buffers , 1983, Oper. Res..

[33]  Rajan Suri,et al.  Infinitesimal perturbation analysis of discrete event dynamic systems: A general theory , 1983, The 22nd IEEE Conference on Decision and Control.

[34]  Rajan Suri,et al.  A technique for on-line sensitivity analysis of flexible manufacturing systems , 1985 .

[35]  Xi-Ren Cao,et al.  The phantom customer and marked customer methods for optimization of closed queueing networks with blocking and general service times , 1983, SIGMETRICS '83.

[36]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

[37]  Rajan Suri,et al.  Modelling flexible manufacturing systems using mean-value analysis , 1984 .

[38]  K. Mani Chandy,et al.  Parametric Analysis of Queuing Networks , 1975, IBM J. Res. Dev..

[39]  Christos G. Cassandras,et al.  A new approach to the analysis of discrete event dynamic systems , 1983, Autom..

[40]  Hideo Miyahara,et al.  An Approximation Method for Open Restricted Queueing Networks , 1980, Oper. Res..