This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Approximate Throughput Analysis of Cyclic Queueing Networks with Finite Buffers
June 1989 (vol. 15 no. 6)
pp. 800-808

An approximation method for obtaining the throughput of cyclic queueing networks with blocking as a function of the number of customers in it is presented. The approximation method was developed for two different blocking mechanisms. It was also extended to the case of the central server model with blocking. Validation tests show that the algorithm is fairly accurate.

[1] I. F. Akyildiz, "On the exact and approximate throughput analysis of closed queueing networks with blocking,"IEEE Trans. Software Eng., vol. 14, no. 1, pp. 62-71, 1988.
[2] I. F. Akyildiz, "Mean value analysis for blocking queueing networks,"IEEE Trans. Software Eng., vol. 14, no. 4, pp. 418-429, 1988.
[3] I. F. Akyildiz, "General closed queueing networks with blocking," inPerform. '87 Proc., pp. 283-303.
[4] G. W. Diehl, "A buffer equivalency decomposition approach to finite buffer queueing networks," Ph.D. dissertation, Dep. Eng. Sci., Harvard Univ., 1984.
[5] W. J. Gordon and G. F. Newell, "Cyclic queueing systems with restricted length queues,"Oper. Res., vol. 15, pp. 266-278, 1967.
[6] W. J. Gordon and G. F. Newell, "Closed queueing systems with exponential servers,"Oper. Res., vol. 15, pp. 254-265, 1987.
[7] F. P. Kelly,Reversibility and Stochastic Networks. New York: Wiley, 1979.
[8] R. Marie, "An approximate analytical method for general queueing networks,"IEEE Trans. Software Eng., vol. SE-5, pp. 530-538, 1979.
[9] R. O. Onvural, "Closed queueing networks with finite buffers," Ph.D. dissertation, CSE/OR, NCSU, 1987.
[10] R. O. Onvural and H. G. Perros, "On equivalencies of blocking mechanisms in queueing networks with blocking,"Oper. Res. Lett., vol. 5, pp. 293-298, 1986.
[11] R. O. Onvural and H. G. Perros, "Some equivalencies between closed queueing networks with blocking,"Perform. Eval., to be published.
[12] R. O. Onvural, "A survey of closed queueing networks with blocking," Dep. Comput. Sci., NCSU. Tech. Rep., 1987.
[13] H. G. Perros, "A survey of queueing networks with blocking (Part I)," Dep. Comput. Sci., NCSU, Tech. Rep. 86-04, 1986.
[14] H. G. Perros, A. Nilsson, and Y. Liu, "Approximate analysis of product form type queueing networks with blocking and deadlock,"Perform. Eval., to be published.
[15] V. De Nitto Persone and D. Grillo, "Managing blocking in finite capacity symmetrical ring networks," inProc. 3rd Conf. Data and Communication Systems and Their Performance, 1987.
[16] J. G. Shanthikumar and D. D. Yao, "Monotonicity properties in cyclic queueing networks with finite buffers," inProc. First Int. Workshop Queueing Networks with Blocking, NCSU, 1988, pp. 368- 392.
[17] R. Suri and G. Diehl, "A new building block for performance evaluation of queueing networks with finite buffers,"ACM Perform. Eval. Rev., 1984, pp. 134-142.
[18] R. Suri and G. W. Diehl, "A variable buffer-size model and its use in analyzing closed queueing networks with blocking,"Management Sci., vol. 32, pp. 206-225, Feb. 1986.

Index Terms:
approximate throughput analysis; validation tests; finite buffers; approximation method; cyclic queueing networks; customers; blocking mechanisms; central server model; computer networks; performance evaluation; queueing theory
Citation:
R.O. Onvural, H.G. Perros, "Approximate Throughput Analysis of Cyclic Queueing Networks with Finite Buffers," IEEE Transactions on Software Engineering, vol. 15, no. 6, pp. 800-808, June 1989, doi:10.1109/32.24733
Usage of this product signifies your acceptance of the Terms of Use.