This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Exact and Approximate Throughput Analysis of Closed Queuing Networks with Blocking
January 1988 (vol. 14 no. 1)
pp. 62-70

A type of blocking is investigated in which, on completion of its service, a job attempts to enter a new station. If, at that moment, the destination station is full, the job is forced to reside in the server of the source station until a place becomes available in the destination station. The server of the source station remains blocked during this period of time. This model is known as a queuing network with transfer blocking. The state space of queuing networks with blocking is reduced by considering finite capacities of the stations. A nonblocking queuing network with the appropriate total number of jobs is derived. The state space of this network is equal to the state space of the blocking queuing network. The transformation of state space is exact for two-station networks and approximate for three-or-more station cases. The approximation has been validated by executing several examples, including stress tests. In all investigated network models, the approximate throughput results deviate, on the average, less than 3% from the simulation results.

[1] I. F. Akyildiz, "Exact product form solution for queueing networks with blocking,"IEEE Trans. Comput., vol. C-36, no. 1, pp. 122- 125, Jan. 1987.
[2] I. F. Akyildiz, "Mean value analysis for blocking queueing networks,"IEEE Trans. Software Eng., to be published.
[3] T. Altiok, "Approximate analysis of exponential tandem queues with blocking,"European J. Oper. Res., vol. 11, pp. 390-398, 1982.
[4] T. Altiok and H. G. Perros, "Approximate analysis of arbitrary configurations of open queueing networks with blocking,"Annu. Oper. Res., 1986.
[5] 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.
[6] 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, Sept. 1985, pp. 245-258.
[7] K. M. Chandy, U. Herzog, and L. Woo, "Parametric analysis of queueing network models,"IBM J. Res. Develop., vol. 19, no. 1, pp, 43-49, Jan. 1975.
[8] E. S. Dattatreya, "Tandem queueing systems with blocking," Ph.D. dissertation, Univ. California at Berkeley, June 1978.
[9] V. de Nitto Persone and D. Grillo, "Managing blocking in finite capacity symmetrical ring networks," inProc. Third Int. Conf. Data Communications and their Performance, Rio de Janeiro, Brazil, June 1987.
[10] R. Onvural and H. G. Perros, "Some exact results on closed queueing networks with blocking," North Carolina State Univ., Tech. Rep., 1987.
[11] R. O. Onvural, "Closed queueing networks with finite buffers," Ph.D. dissertation, North Carolina State Univ., May 1987.
[12] H. G. Perros, "Queueing networks with blocking: A bibliography,"ACM Sigmetrics Performance Eval. Rev., August 1984.
[13] 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.
[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] M. Reiser and S. Lavenberg, "Mean value analysis of closed multichain queueing networks,"J. ACM, vol. 27, no. 2, Apr. 1980.
[16] C. H. Sauer and K. M. Chandy,Computer Systems Performance Modeling. Englewood Cliffs, NJ: Prentice-Hall, 1981.
[17] P. Schweitzer and T. Altiok, "Aggregate modeling of tandem queues with blocking," inProc. Second Int. Workshop Applied Mathematics and Performance/Reliability Models of Computer Communication Systems, Univ. Rome II, Rome, Italy, May 1987.
[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.
[19] 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.
[20] G. Yamazaki, T. Kawashima, and H. Sakasegawa, "Reversibility of tandem blocking queueing systems,"Management Sci., vol. 31, no. 1, pp. 78-83, Jan. 1985.

Index Terms:
exact throughput; approximate throughput analysis; closed queuing networks; blocking; source station; destination station; transfer blocking; state space; two-station networks; simulation results; performance evaluation; queueing theory; virtual machines
Citation:
I.F. Akyildiz, "On the Exact and Approximate Throughput Analysis of Closed Queuing Networks with Blocking," IEEE Transactions on Software Engineering, vol. 14, no. 1, pp. 62-70, Jan. 1988, doi:10.1109/32.4623
Usage of this product signifies your acceptance of the Terms of Use.