Skip to main content
SpringerLink
Log in

A survey of product form queueing networks with blocking and their equivalences

  • Exact Analysis
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Queueing network models have been extensively used to represent and analyze resource sharing systems, such as production, communication and information systems. Queueing networks with blocking are used to represent systems with finite capacity resources and with resource constraints. Different blocking mechanisms have been defined and analyzed in the literature to represent distinct behaviors of real systems with limited resources. Exact product form solutions of queueing networks with blocking have been derived, under special constraints, for different blocking mechanisms. In this paper we present a survey of product form solutions of queueing networks with blocking and equivalence properties among different blocking network models. By using such equivalences we can extend product form solutions to queueing network models with different blocking mechanisms. The equivalence properties include relationships between open and closed product form queueing networks with different blocking mechanisms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I.F. Akyildiz, Exact product form solution for queueing networks with blocking, IEEE Trans. Comput. C-36 (1987) 122–125.

    Google Scholar 

  2. I.F. Akyildiz and H. von Brand, Central server models with multiple job classes, state dependent routing, and rejection blocking, IEEE Trans. Softw. Eng. SE-15 (1989) 1305–1312.

    Google Scholar 

  3. I.F. Akyildiz and H. von Brand, Exact solutions for open, closed and mixed queueing networks with rejection blocking, J. Theor. Comp. Sci. 64 (1989) 203–219.

    Google Scholar 

  4. I.F. Akyildiz and N. van Dijk, Exact solution for networks of parallel queues with finite buffers, in:Proc. Performance '90, eds. P.J.B. King, I. Mitrani and R.J. Pooley (North-Holland, 1990) pp. 35–49.

  5. I.F. Akyildiz and H.G. Perros, Special issue on queueing networks with finite capacity queues, Perf. Eval. 10 (1989) no. 3.

    Google Scholar 

  6. T. Altiok and S.S. Stidham, A note on transfer line with unreliable machines, random processing times, and finite buffers, IIE Trans. (1982) 125–127.

  7. T. Altiok and H.G. Perros, Approximate analysis of arbitrary configurations of queueing networks with blocking, Ann. Oper. Res. 9 (1987) 481–509.

    Google Scholar 

  8. S. Balsamo and V. de Nitto Personè, Closed queueing networks with finite capacities: blocking types, product-form solution and performance indices, Perf. Eval. 12 (1991) 85–102.

    Google Scholar 

  9. F. Baskett, K.M. Chandy, R.R. Muntz and G. Palacios, Open, closed and mixed networks of queues with different classes of customers, J. ACM 22 (1985) 248–260.

    Google Scholar 

  10. O. Boxma and A.G. Konheim, Approximate analysis of exponential queueing systems with blocking, Acta Info. 15 (1981) 19–66.

    Google Scholar 

  11. P. Caseau and G. Pujolle, Throughput capacity of a sequence of transfer lines with blocking due to finite waiting room, IEEE Trans. Softw. Eng. SE-5 (1979) 631–642.

    Google Scholar 

  12. K.M. Chandy and A.J. Martin, A characterization of product-form queueing networks, J. ACM 30 (1983) 286–299.

    Google Scholar 

  13. K.M. Chandy, J.H. Howard and D. Towsley, Product form and local balance in queueing networks, J. ACM 24 (1977) 250–263.

    Google Scholar 

  14. J.W. Cohen, The multiple phase service network with generalized processor sharing, Acta Inf. 12 (1979) 245–284.

    Google Scholar 

  15. Y. Dallery and D.D. Yao, Modelling a system of flexible manufacturing cells, in:Modeling and Design of Flexible Manufacturing Systems, ed. Kusiak (North-Holland, 1986) pp. 289–300.

  16. S. Gershwin and U. Berman, Analysis of transfer lines consisting of two unreliable machines with random processing times and finite storage buffers, AIIE Trans. 13 (1981) 2–11.

    Google Scholar 

  17. W.J. Gordon and G.F. Newell, Cyclic queueing systems with restricted queues, Oper. Res. 15 (1976) 286–302.

    Google Scholar 

  18. F.S. Hillier and R.W. Boling, Finite queues in series with exponential or Erlang service times — a numerical approach, Oper. Res. 15 (1967) 286–303.

    Google Scholar 

  19. A. Hordijk and N. van Dijk, Networks of queues with blocking, in:Performance '81, ed. K.J. Kylstra (North-Holland, 1981) pp. 51–65.

  20. A. Hordijk and N. van Dijk, Networks of queues; Part I: Job-local-balance and the adjoint process; Part II: General routing and service characteristics, in:Lecture Notes in Control and Information Sciences, eds. F. Baccelli and G. Fajolle (Springer, 1983) pp. 158–205.

  21. F.P. Kelly,Reversibility and Stochastic Networks (Wiley, 1979).

  22. J.F.C. Kingman, Markovian population process, J. Appl. Prob. 6 (1969) 1–18.

    Google Scholar 

  23. L. Kleinrock,Queueing Systems. Vol. 1:Theory (Wiley, 1975).

  24. A.G. Konhein and M. Reiser, A queueing model with finite waiting room and blocking, SIAM J. Comp. 7 (1978) 210–229.

    Google Scholar 

  25. A.E. Krzesinski, Multiclass queueing networks with state-dependent routing, Perf. Eval. 7 (1987) 125–145.

    Google Scholar 

  26. J.R. Jackson, Jobshop-like queueing systems, Manag. Sci. 10 (1963) 131–142.

    Google Scholar 

  27. S.S. Lam, Queueing networks with capacity constraints, IBM J. Res. Dev. 21 (1977) 370–378.

    Google Scholar 

  28. S.S. Lavenberg,Computer Performance Modeling Handbook (Prentice-Hall, 1983).

  29. M.F. Neuts, Two queues in series with a finite intermediate waiting room, J. Appl. Prob. 5 (1986) 123–142.

    Google Scholar 

  30. R.O. Onvural, A note on the product form solutions of multiclass closed queueing networks with blocking, Perf. Eval. 10 (1989) 247–253.

    Google Scholar 

  31. R.O. Onvural, Survey of closed queueing networks with blocking, ACM Comp. Surveys 22 (1990) 83–121.

    Google Scholar 

  32. R.O. Onvural and H.G. Perros, On equivalences of blocking mechanisms in queueing networks with blocking, Oper. Res. Lett. (1986) 293–297.

  33. R.O. Onvural and H.G. Perros, Some equivalencies on closed exponential queueing networks with blocking, Perf. Eval. 9 (1989) 111–118.

    Google Scholar 

  34. H.G. Perros, Open queueing networks with blocking, in:Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (North-Holland, 1989).

  35. H.G. Perros, A bibliography of papers on queueing networks with finite capacity queues, Perf. Eval. 10 (1989) 225–260.

    Google Scholar 

  36. B. Pittel, Closed exponential networks of queues with saturation: the Jackson-type stationary distribution and its asymptotic analysis, Math. Oper. Res. 4 (1979) 367–378.

    Google Scholar 

  37. D.F. Towsley, Queueing network models with state-dependent routing, J. ACM 27 (1980) 323–337.

    Google Scholar 

  38. N. van Dijk, On “stop = repeat” servicing for non-exponential queueing networks with blocking, J. Appl. Prob. 28 (1991) 159–173.

    Google Scholar 

  39. N. van Dijk, “Stop = recirculate” for exponential product form queueing networks with departure blocking, Oper. Res. Lett. 10 (1991) 343–351.

    Google Scholar 

  40. N. van Dijk and H.G. Tijms, Insensitivity in two node blocking models with applications, in:Proc. Teletraffic Analysis and Computer Performance Evaluation, eds. Boxma, Cohen and Tijms (North-Holland, 1986) pp. 329–340.

  41. D.D. Yao and J.A. Buzacott, Modeling a class of state-dependent routing in flexible manufacturing systems, Ann. Oper. Res. 3 (1985) 153–167.

    Google Scholar 

  42. D.D. Yao and J.A. Buzacott, Modeling a class of flexible manufacturing systems with reversible routing, Oper. Res. 35 (1987) 87–93.

    Google Scholar 

  43. P. Whittle, Partial balance and insensitivity, J. Appl. Prob. 22 (1985) 168–175.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Pisa, Pisa, Italy

    Simonetta Balsamo

  2. Department of Elect. Engineering, University of Roma Tor Vergata, Rome, Italy

    Vittoria de Nitto Personè

Authors
  1. Simonetta Balsamo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vittoria de Nitto Personè
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work has been partially supported by CNR Project Research Funds “Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo” and by MURST Project Research Funds “Performability hw/sw di sistemi distribuiti e paralleli”.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Balsamo, S., Personè, V.d.N. A survey of product form queueing networks with blocking and their equivalences. Ann Oper Res 48, 31–61 (1994). https://doi.org/10.1007/BF02023094

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02023094

Keywords

Search

Navigation