Identity and Reducibility Properties of Some Blocking and Non-Blocking Mechanisms in Congested Networks

  • S. Balsamo
  • V. De Nitto Personè
  • G. Lazeolla
Part of the NATO ASI Series book series (volume 38)


Networks of queues with blocking are used for representing resource constraints in production, communication and computer systems. Different types of blocking which have been studied in various application fields will be compared and proved to be either identical (in terms of general performance indices) or reducible one to the other. The case is also shown of identity and reducibility properties holding between some types of blocking networks and some types of non-blocking ones.


Destination Node General Topology Blocking Model Queueing Network State Transition Diagram 
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. [Bals83]
    Balsamo, S., Lazeolla, G., “Some equivalence properties for queueing networks with and without blocking”, Proc. Performance ’83 Symposium, North Holland, (1983).Google Scholar
  2. [Bals86]
    Balsamo, S., De Nitto Persona, V., Lazeolla, G., “Some Equivalences of Blocking Mechanisms in Queueing Networks with Finite Capacity”, Tech. Rep. R86.02, Dep. Electr. Eng., University Roma II, (1986).Google Scholar
  3. [Boxm81]
    Boxma, O.J., Konheim, A.G., “Approximate Analysis of Exponential Queueing Systems with Blocking”, Acta Informatica, Vol. 15, (1981), pp. 19–66.MathSciNetMATHCrossRefGoogle Scholar
  4. [Gers81]
    Gershwin, S., Berman, U., “Analysis of Transfer Lines Consisting of two Unreliable Machines with Random Processing Times and Finite Storage Buffers”, AIIE Trans., 13, no. 1,(1981), pp. 2–11.CrossRefGoogle Scholar
  5. [Gord67]
    Gordon, W.J., Newell, G.F., “Cycling Queueing Systems with Restricted Length Queues”, Oper. Res., 15, (1967), pp. 266–278.MATHCrossRefGoogle Scholar
  6. [Hill67]
    Hillier, F.S., Boling, R.W., “Finite Queues in Series with Exponential or Erlang Service Times. A Numerical Approach”, Oper. Res., 15, (1967), pp. 286–303.MATHCrossRefGoogle Scholar
  7. [Hord81]
    Hordijk, A., Van Dijk, N., “Networks of Queues with Blocking”, Performance ’81, Kylstra (Ed.), North Holland, (1981), pp. 51–65.Google Scholar
  8. [King69]
    Kingman, J.F.C., “Markovian Population Process”, Journal of Applied Probability, 6, (1969), pp. 1–18.MathSciNetMATHCrossRefGoogle Scholar
  9. [Klei75]
    Kleinrock, L., “Queueing Systems. Vol. 1: Theory”, Wiley, NY, (1975).Google Scholar
  10. [Konh76]
    Konheim, A.G., Reiser, M., “A Queueing Model with Finite Waiting Room and Blocking”, SIAM J. Computing, 7, (1978), pp. 210–229.MathSciNetMATHCrossRefGoogle Scholar
  11. [Lave83]
    Lavenberg, S.S., “Computer Performance Modeling Handbook”, Academic Press, (1983).MATHGoogle Scholar
  12. [Laza84]
    Lazar, A.A., Robertazzi, T.G., “The Geometry of lattices for Markovian Queueing Networks”, Columbia University, Elect. Eng. Dept., (1984).Google Scholar
  13. [Lazo84]
    Lazowska, E.D., Zahorjan, J., Graham, G.S., Sevcik, K.C., “Quantitative System Performance”, Prentice Hall, Englewood Cliffs, NJ, (1984).Google Scholar
  14. [Neut68]
    Neuts, M.F., “Two Queues in Series with a Finite Intermediate Waiting Room”, Journal of Applied Probability, 5, (1968), pp. 123–142.MathSciNetMATHCrossRefGoogle Scholar
  15. [Perr81]
    Perros, H.G., “A Symmetrical Exponential Queueing Network with Blocking and Feedback”, IEEE Trans. SE, vol. SE-7, (1981), pp. 395–402.MathSciNetGoogle Scholar
  16. [Perr84]
    Perros, H.G., “Queueing Networks with Blocking: a Bibliography”, Perf. Eval. Rew., Spring 1984, pp. 8–12.Google Scholar
  17. [Pitt78]
    Pittel, B., “Closed Exponential Networks of Queues with Saturation: the Jackson-type Stationary Distribution and its Asymptotic Analysis”, Math. Oper. Res., 4, (1979), pp. 367–378.MathSciNetCrossRefGoogle Scholar
  18. [Saue81]
    Sauer, C.H., Chandy, K.M., “Computer System Performance Modeling”, Prentice Hall, Englewood Cliffs, NJ, (1981).Google Scholar
  19. [Suri83]
    Suri, R., Diehl, G.W., “A variable Buffer Size Model and its use in Analytic Closed Queueing Networks with Blocking”, Hardward University, Division of Applied Sciences, (1983).Google Scholar
  20. [Suri84]
    Suri, R., Diehl, G.W., “A New ‘Building Block’ for Performance Evaluation of Queueing Networks with Finite Buffers”, Proc. ACM Sigmetrics, (1984), pp. 134–142.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • S. Balsamo
    • 1
  • V. De Nitto Personè
    • 1
  • G. Lazeolla
    • 2
  1. di InformaticaUniversità di PisaPisaItaly
  2. di Ingegneria ElettronicaUniversità di Roma IIRomaItaly

Personalised recommendations