This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Mean Value Analysis for Blocking Queueing Networks
April 1988 (vol. 14 no. 4)
pp. 418-428

Mean value analysis is an exact solution technique for infinite capacity queueing networks and enjoyed widespread popularity during recent years. It considers the behavior of the system by stepwise increasing the number of jobs in the entire network, thus it is well suited for the analysis of queueing networks with blocking. In this work, an approximation is introduced for the mean value analysis queueing networks with transfer blocking. The blocking occurs when a job, after service at a station, wants to join a station which is full. The job resides in the server of the source station until a place becomes available in the destination station. The approximation is based on the modification of mean residence times due to the blocking events that occur in the network. Several examples are executed in order to validate the approximate results.

[1] I. F. Akyildiz, "Exact product form solution for queueing networks with blocking,"IEEE Trans. Comput., vol. C-36, pp. 122-125, Jan. 1987.
[2] I. F. Akyildiz, "On the exact and approximate throughput analysis of closed queueing networks with blocking,"IEEE Trans. Software Eng., vol.14, pp. 62-71, Jan. 1988.
[3] I. F. Akyildiz, "Product form approximations for queueing networks with multiple servers and blocking,"IEEE Trans. Comput., to be published.
[4] I. F. Akyildiz and S. Kundu. "Buffer allocation in deadlock free blocking queueing networks," Dep. Comput. Sci., Louisiana State Univ., Tech. Rep. TR-86-013, Apr. 1986.
[5] T. Altiok, "Approximate analysis of exponential tandem queues with blocking,"European J. Oper. Res., vol.11, pp. 390-398, Oct. 1982.
[6] T. Altiok and H. G. Perros, "Approximate analysis of arbitrary configurations of open queueing networks with blocking,"AIIE Trans., Mar. 1986.
[7] Y. Bard, "Some extension to multiclass queueing network analysis," inFourth Int. Conf. Modeling and Performance Evaluation of Computer Systems, vol. 1, Vienna, Austria, Feb. 1979.
[8] F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios, "Open, closed, and mixed networks of queues with different classes of customers,"J. ACM, vol. 22, no. 2, pp. 248-260, 1975.
[9] A. Brandwajn and Y. L. Jow, "Tandem exponential queues with finite buffers," inProc. Computer Networking and Performance Evaluation, T. Hasegawa, H. Takagi, and Y. Takahashi, Eds. Amsterdam, The Netherlands: North-Holland, 1985, pp. 245- 258.
[10] L. Gun and A. Mckowski, "Matrix-geometric solution for finite capacity queues with phase-type distributions," inProc. Performance87Conf., P. J. Courtois and G. Latouche, Eds. Amsterdam, The Netherlands: North-Holland, 1988, pp. 269-282.
[11] R. O. Onvural and H. G. Perros, "Some exact results on closed queueing networks with blocking," Dep. Comput. Sci., NCSU, Tech. Rep., 1987.
[12] R. O. Onvural, "A survey of closed queueing networks with finite buffers," Dep. Comput. Sci., NCSU, Tech. Rep., 1987.
[13] H. G. Perros, "Queueing networks with blocking: A bibliography,"ACM Sigmetrics Perform. Eval. Rev., Aug. 1984.
[14] H. G. Perros and T. Altiok, "Approximate analysis of open networks of queues with blocking: tandem configurations,"IEEE Trans. Software Eng., vol. SE-12, pp. 450-462, Mar. 1986.
[15] 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.
[16] M. Reiser and S. Lavenberg, "Mean value analysis of closed multichain queueing networks,"J. ACM, vol. 27, no. 2, Apr. 1980.
[17] C. H. Sauer and K. M. Chandy,Computer Systems Performance Modeling. Englewood Cliffs, NJ: Prentice-Hall, 1981.
[18] P. J. Schweitzer and T. Altiok, "Aggregate modeling of tandem queues with blocking," inProc. Second Int. Workshop Applied Math. and Performance/Reliability ModelsofComputer/Communication Systems, Univ. Rome, Italy, May 1987.
[19] K.C. Sevcik and I. Mitrani, "The Distribution of Queueing Network States at Input and Output Instants,"J. ACM, Vol. 28, No. 2, Apr. 1981, pp. 358-371.
[20] W. Stewart, "A comparison of numerical techniques in Markov modeling,"Commun. ACM, vol.21, no. 2, pp, 144-152, Feb. 1978.
[21] 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.
[22] Y. Takahashi, H. Miyahara, and T. Hasegawa, "An approximation method for open restricted queueing networks,"Oper. Res., vol. 28, no. 3, pp. 594-602, May-June 1980.

Index Terms:
Blocking, finite station capacities, performance evaluation, performance measures, queueing network models.
Citation:
I.F. Akyildiz, "Mean Value Analysis for Blocking Queueing Networks," IEEE Transactions on Software Engineering, vol. 14, no. 4, pp. 418-428, April 1988, doi:10.1109/32.4663
Usage of this product signifies your acceptance of the Terms of Use.