A decomposition-related throughput property of tandem queueing networks with blocking

A general throughput property of tandem queueing networks with blocking that relates existing decomposition methods to throughput bounds is discussed using the sample path approach.

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

[2]  M.B.M. deKoster.  Estimation of Line Efficiency by Aggregation , 1987 .

[3]  Eginhard J. Muth,et al.  Stochastic processes and their network representations associated with a production line queuing model , 1984 .

[4]  D. K. Hildebrand.  STABILITY OF FINITE QUEUE, TANDEM SERVER SYSTEMS , 1967 .

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

[6]  R. David,et al.  An aggregation method for performance evaluation of transfer lines with unreliable machines and finite buffers , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[7]  W. J. Hopp,et al.  Bounds and heuristics for assembly-like queues , 1989, Queueing Syst. Theory Appl..

[8]  Stanley B. Gershwin,et al.  An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking , 1987, Oper. Res..

[9]  J. George Shanthikumar,et al.  Bounding the performance of tandem queues with finite buffer spaces , 1994, Ann. Oper. Res..

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

[11]  J. A. Buzacott,et al.  Matrix-geometric and Recursive Algorithm Solution of a Two-stage Unreliable How Line , 1987 .

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