Queueing Networks with Blocking

  • Simonetta Balsamo
  • Vittoria de Nitto Personé
  • Raif Onvural
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 31)


In this chapter, we introduce queueing networks with finite capacity queues. When limitations are imposed on the queue capacities, a phenomenon called blocking occurs. Simply defined, blocking is forcing a departure from a queue or an arrival to a queue to stop temporarily due to lack of space in the queue. In Section 2.1 we define single class networks. There are different blocking mechanisms introduced in the literature to model different types of flow systems with finite resources. These blocking mechanisms are defined in Section 2.2. The relation between blocking and state dependent routing is introduced in Section 2.3. The extension of results presented in the context of single class networks with finite capacities to multiclass networks with blocking is presented in Section 2.4. Finally, various performance metrics of interest in the analysis of blocking networks are defined in Section 2.5. Bibliographical notes and references are presented in Section 2.6.


Destination Node Queue Length Service Time Distribution Service Discipline Queueing Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Akyildiz, I.F. “Exact product form solution for queueing networks with blocking” IEEE Trans. on Computer, Vol. 36 (1987) 122–125.CrossRefGoogle Scholar
  2. Akyildiz, I.F., and H.G. Perros Special Issue on Queueing Networks with Finite Capacity Queues, Performance Evaluation, Vol. 10, 3 (1989).Google Scholar
  3. Akyildiz, I.F., and N. Van Dijk “Exact Solution for Networks of Parallel Queues with Finite Buffers” in: Proc. Performance ’90 (P.J.B. King, I. Mitrani and R.J. Pooley Eds.) North-Holland (1990) 35–49.Google Scholar
  4. Akyildiz, I.F., and H. Von Brand “Central Server Models with Multiple Job Classes, State Dependent Routing, and Rejection Blocking” IEEE Trans. on Softw. Eng., Vol. 15 (1989) 1305–1312.CrossRefGoogle Scholar
  5. Akyildiz, I.F., and H. Von Brand “Exact solutions for open, closed and mixed queueing networks with rejection blocking” J. Theor. Computer Science, Vol. 64 (1989) 203–219.CrossRefGoogle Scholar
  6. Altiok, T., and H.G. Perros “Approximate analysis of arbitrary configurations of queueing networks with blocking” Ann. Oper. Res., Vol. 9 (1987) 481–509CrossRefGoogle Scholar
  7. Altiok, T., and S.S. Stidham “A note on Transfer Line with Unreliable Machines, Random Processing Times, and Finite Buffers” IIE Trans., Vol. 14, 4 (1982) 125–127.Google Scholar
  8. Balsamo, S., and C. Clò “State distribution at arrival times for closed queueing networks with blocking” Technical Report TR-35/92, Dept. of Comp. Sci., University of Pisa, 1992.Google Scholar
  9. Balsamo, S., C. Clò, and L. Donatiello “Cycle Time Distribution of Cyclic Queueing Network with Blocking”, in Queueing Networks with Finite Capacities (R.O. Onvural and I.F. Akyidiz Eds.), Elsevier, 1993, and Performance Evaluation, Vol. 17 (1993) 159–168.Google Scholar
  10. Balsamo, S., and C. Clò “Delay distribution in a central server model with blocking”, Technical Report TR-14/93, Dept. of Comp. Sci., University of Pisa, 1993.Google Scholar
  11. Balsamo, S., and V. De Nitto Personè “Closed queueing networks with finite capacities: blocking types, product-form solution and performance indices” Performance Evaluation, Vol. 12, 4 (1991) 85–102.CrossRefGoogle Scholar
  12. Balsamo, S., and V. De Nitto Personè “A survey of Product-form Queueing Networks with Blocking and their Equivalences” Annals of Operations Research, Vol. 48 (1994) 31–61.CrossRefGoogle Scholar
  13. Balsamo, S., and L. Donatiello “On the Cycle Time Distribution in a Two-stage Queueing Network with Blocking” IEEE Transactions on Software Engineering, Vol. 13 (1989) 1206–1216.CrossRefGoogle Scholar
  14. Balsamo, S., and L. Donatiello “Two-stage Queueing Networks with Blocking: Cycle Time Distribution and Equivalence Properties”, in Modelling Techniques and Tools for Computer Performance Evaluation (R. Puigjaner, D. Potier Eds.) Plenum Press, 1989.Google Scholar
  15. Balsamo, S., and Iazeolla, G. “Some Equivalence Properties for Queueing Networks with and without Blocking”, in Performance ’83 (A.K. Agrawala, S.K. Tripathi Eds.) North Holland, 1983.Google Scholar
  16. Balsamo, S., and G. Iazeolla “Synthesis of Queueing Networks with Block and Statedependent Routing” Computer System Science and Engineering, Vol. 1 (1986).Google Scholar
  17. Baskett, F., K.M. Chandy, R.R. Muntz, and G. Palacios “Open, closed, and mixed networks of queues with different classes of customers” J. of ACM, Vol. 22 (1975) 248–260.CrossRefGoogle Scholar
  18. Boxma, O., and A.G. Konheim “Approximate analysis of exponential queueing systems with blocking” Acta Informatica, Vol. 15 (1981) 19–66.CrossRefGoogle Scholar
  19. Boxma, O., and H. Daduna “Sojourn time distribution in queueing networks” in ‘Stochastic Analysis of computer and Communication Systems’ (H. Takagi Ed.) North Holland, 1990.Google Scholar
  20. Buzacott, J.A. “Queueing Models of Kanban and MRP controlled production systems” Engineering Costs and Production Economics, Elsevier Science Pub., Vol. 17 (1989) 3–20.Google Scholar
  21. Caseau, P., and G. Pujolle “Throughput capacity of a sequence of transfer lines with blocking due to finite waiting room” IEEE Trans. on Softw. Eng., Vol. 5 (1979) 631–642.CrossRefGoogle Scholar
  22. Chandy, K.M., J.H. Howard, and D. Towsley “Product form and local balance in queueing networks” J. ACM, Vol. 24 (1977) 250–263.CrossRefGoogle Scholar
  23. Chandy, K.M., U. Herzog, and L. Woo “Parametric analysis of queueing networks” IBM J. Res. Dev., Vol. 1 (1975) 36–42.CrossRefGoogle Scholar
  24. Chandy, K.M., and A.J. Martin “A characterization of product-form queueing networks” J. ACM, Vol.30 (1983) 286–299.CrossRefGoogle Scholar
  25. Cheng, D.W. “Analysis of a tandem queue with state dependent general blocking: a GSMP perspective” Performance Evaluation, Vol. 17 (1993) 169–173.CrossRefGoogle Scholar
  26. Choukri, T. “Exact Analysis of Multiple Job Classes and Different Types of Blocking” in Queueing Networks with Finite Capacities (R.O. Onvural and I.F. Akyidiz Eds.), Elsevier, 1993.Google Scholar
  27. Cohen, J.W. “The multiple phase service network with generalized processor sharing” Acta Informatica, Vol. 12 (1979) 245–284.CrossRefGoogle Scholar
  28. Courtois, P.J., and P. Semal “Computable bounds for conditional steady-state probabilities in large Markov chains and queueing models” IEEE Journal on SAC, Vol. 4 (1986) 920–936.Google Scholar
  29. Dallery, Y., and Y. Frein “A decomposition method for the approximate analysis of closed queueing networks with blocking”, Proc. First Int. Workshop on Queueing Networks with Blocking, (H.G. Perros and T. Altiok Eds.) North Holland, 1989.Google Scholar
  30. Dallery, Y., and D.F. Towsley “Symmetry property of the throughput in closed tandem queueing networks with finite buffers” Op. Res. Letters, Vol. 10 (1991) 541–547.CrossRefGoogle Scholar
  31. Dallery, Y., and D.D. Yao “Modelling a system of flexible manufacturing cells” in: Modeling and Design of Flexible Manufacturing Systems (Kusiak Ed.) North-Holland, 1986, 289–300.Google Scholar
  32. De Nitto Personè, V., and D. Grillo “Managing Blocking in Finite Capacity Symmetrical Ring Networks” Third Int. Conf. on Data Comm. Systems and their Performance, Rio de Janeiro, Brazil, June 22–25 (1987) 225–240.Google Scholar
  33. Frein, Y., and Y. Dallery “Analysis of Cyclic Queueing Networks with Finite Buffers and Blocking Before Service”, Performance Evaluation, Vol. 10 (1989) 197–210.CrossRefGoogle Scholar
  34. Gershwin, S. “An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking” Oper. Res., Vol. 35 (1987) 291–305.CrossRefGoogle Scholar
  35. Gershwin, S., and U. Berman “Analysis of transfer lines consisting of two unreliable machines with random processing times and finite storage buffers” AIIE Trans., Vol. 13 (1981) 2–11.CrossRefGoogle Scholar
  36. Gordon, W.J., and G.F. Newell “Cyclic queueing systems with restricted queues” Oper. Res., Vol. 15 (1967) 286–302.CrossRefGoogle Scholar
  37. Gün, L., and A.M. Makowski “An approximation method for general tandem queueing systems subject to blocking” Proc. First Int. Workshop on Queueing Networks with Blocking, (H.G. Perros and T. Altiok Eds.) North Holland, 1989,147–171.Google Scholar
  38. Hillier, F.S., and R.W. Boling “Finite queues in series with exponential or Erlang service times — a numerical approach” Oper. Res., Vol. 15 (1967) 286–303.CrossRefGoogle Scholar
  39. Hordijk, A., and N. Van Dijk “Networks of queues with blocking”, in: Performance ’81 (K.J. Kylstra Ed.) North Holland (1981) 51–65.Google Scholar
  40. Hordijk, A., and N. Van Dijk “Networks of queues; Part I: job-local-balance and the adjoint process; Part II: General routing and service characteristics”, in: Lect. Notes in Control and Information Sciences (F. Baccelli and G. Fajolle Eds.) Springer-Verlag, 1983, 158–205.Google Scholar
  41. Jackson, J.R. “Jobshop-like queueing systems” Management Science, Vol. 10 (1963) 131–142.CrossRefGoogle Scholar
  42. Kelly, F.P. Reversibility and Stochastic Networks. Wiley (1979).Google Scholar
  43. Kingman, J.F.C. “Markovian population process” J. Appl. Prob., Vol. 6 (1969) 1–18.CrossRefGoogle Scholar
  44. Kleinrock, L. Queueing Systems. Vol.1: Theory, Wiley (1975).Google Scholar
  45. Konhein, A.G., and M. Reiser “A queueing model with finite waiting room and blocking” SIAM J. of Comput, Vol. 7 (1978) 210–229.CrossRefGoogle Scholar
  46. Kouvatsos, D., and N.P. Xenios “Maximum entropy analysis of general queueing networks with blocking” Proc. First Int. Workshop on Queueing Networks with Blocking, (H.G. Perros and T. Altiok Eds.) North Holland, 1989.Google Scholar
  47. Krzesinski, A.E. “Multiclass queueing networks with state-dependent routing” Performance Evaluation, Vol.7 (1987) 125–145.CrossRefGoogle Scholar
  48. Kundu, S., and I. Akyildiz “Deadlock free buffer allocation in closed queueing networks” Queueing Systems Journal, Vol. 4 (1989) 47–56.CrossRefGoogle Scholar
  49. Lam, S.S. “Queueing networks with capacity constraints” IBM J. Res. Develop., Vol. 21 (1977) 370–378.CrossRefGoogle Scholar
  50. Lavenberg, S.S. Computer Performance Modeling Handbook. Prentice Hall, 1983.Google Scholar
  51. Lavenberg, S.S., and M. Reiser “Stationary State Probabilities at Arrival Instants for Closed Queueing Networks with multiple Types of Customers” J. Appl. Prob., Vol. 17 (1980) 1048–1061.CrossRefGoogle Scholar
  52. Mishra, S., and S.C. Fang “A maximum entropy optimization approach to tandem queues with generalized blocking” Performance Evaluation, Vol. 30 (1997) 217–241.CrossRefGoogle Scholar
  53. Mitra, D., and I. Mitrani “ Analysis of a Kanban discipline for cell coordination in production lines I” Management Science, Vol. 36 (1990) 1548–1566.CrossRefGoogle Scholar
  54. Mitra, D., and I. Mitrani “ Analysis of a Kanban discipline for cell coordination in production lines II: Stochastic demands” Operations Research, Vol. 36 (1992) 807–823.Google Scholar
  55. Neuts, M.F. “Two queues in series with a finite intermediate waiting room” J. Appl. Prob., 5 (1986) 123–142.CrossRefGoogle Scholar
  56. Onvural, R.O. “A Note on the Product Form Solutions of Multiclass Closed Queueing Networks with Blocking” Performance Evaluation, Vol.10 (1989) 247–253.CrossRefGoogle Scholar
  57. Onvural, R.O. “Survey of Closed Queueing Networks with Blocking” ACM Computing Surveys, Vol. 22 (1990) 83–121.CrossRefGoogle Scholar
  58. Onvural, R.O. Special Issue on Queueing Networks with Finite Capacity, Performance Evaluation, Vol. 17 (1993).Google Scholar
  59. Onvural, R.O., and H.G. Perros “On equivalences of blocking mechanisms in queueing networks with blocking” Oper. Res. Letters, Vol. 5 (1986) 293–297.CrossRefGoogle Scholar
  60. Onvural, R.O., and H.G. Perros “Some equivalencies on closed exponential queueing networks with blocking” Performance Evaluation, Vol.9 (1989) 111–118.CrossRefGoogle Scholar
  61. Perros, H.G. “Open queueing networks with blocking” in Stochastic Analysis of Computer and Communications Systems (Takagi Ed.), North Holland, 1989.Google Scholar
  62. Perros, H.G. “A bibliography of papers on queueing networks with finite capacity queues” Performance Evaluation, Vol. 10 (1989) 225–260.CrossRefGoogle Scholar
  63. Perros, H.G. Queueing networks with blocking. Oxford University Press, 1994.Google Scholar
  64. Perros, H.G., A. Nilsson, and Y.G. Liu “Approximate analysis of product form type queueing networks with blocking and deadlock” Performance Evaluation, Vol. 8 (1988) 19–39.CrossRefGoogle Scholar
  65. Perros, H.G., and P.M. Snyder “A computationally efficient approximation algorithm for analyzing queueing networks with blocking” Performance Evaluation, Vol. 9 (1988/89) 217–224.CrossRefGoogle Scholar
  66. Pittel, B. “Closed exponential networks of queues with saturation: the Jackson-type stationary distribution and its asymptotic analysis” Math. Oper. Res., Vol. 4 (1979) 367–378.CrossRefGoogle Scholar
  67. Sevcik, K.S., and I. Mitrani “The Distribution of Queueing Network States at Input and Output Instants” J. of ACM, Vol. 28 (1981) 358–371.CrossRefGoogle Scholar
  68. Shantikumar, G.J., and D.D. Yao “Monotonicity properties in cyclic networks with finite buffers” Proc. First Int. Workshop on Queueing Networks with Blocking, (H.G. Perros and T. Altiok Eds.) North Holland, 1989.Google Scholar
  69. Suri, R., and G.W. Diehl “A variable buffer size model and its use in analytical closed queueing networks with blocking” Management Sci. Vol.32 (1986) 206–225.CrossRefGoogle Scholar
  70. Towsley, D.F. “Queueing network models with state-dependent routing” J. ACM, Vol. 27 (1980) 323–337.CrossRefGoogle Scholar
  71. Van Dijk, N. “On ‘stop = repeat’ servicing for non-exponential queueing networks with blocking” J. Appl. Prob., Vol. 28 (1991) 159–173.CrossRefGoogle Scholar
  72. Van Dijk, N. “‘Stop = recirculate’ for exponential product form queueing networks with departure blocking” Oper. Res. Lett., Vol. 10 (1991) 343–351.CrossRefGoogle Scholar
  73. Van Dijk, N. “On the Arrival Theorem for communication networks” Computer Networks and ISDN Systems, Vol. 25 (1993) 1135–1142.CrossRefGoogle Scholar
  74. Van Dijk, N.M., and H.C. Tijms “Insensitivity in Two Node Blocking Models with Applications” in Teletraffic Analysis and Computer Performance Evaluation Boxma, (Cohen and Tijms Eds.), Elsevier Science Publishers, North Holland, 1986, 329–340.Google Scholar
  75. Whittle, P. “Partial balance and insensitivity” J. Appl. Prob. 22 (1985) 168–175.CrossRefGoogle Scholar
  76. Yao, D.D., and J.A. Buzacott “Modeling a class of state-dependent routing in flexible manufacturing systems” Annals of Oper. Res., Vol. 3 (1985) 153–167.CrossRefGoogle Scholar
  77. Yao, D.D., and J.A. Buzacott “Modeling a class of flexible manufacturing systems with reversible routing” Oper. Res., Vol. 35 (1987) 87–93.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Simonetta Balsamo
    • 1
  • Vittoria de Nitto Personé
    • 2
  • Raif Onvural
    • 3
  1. 1.Universita’ di VeneziaItaly
  2. 2.Universita’ di Roma “Tor Vergata”Italy
  3. 3.IBMUSA

Personalised recommendations