Introduction

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

Abstract

System performance has been a major issue in the design and implementation of computer systems, production systems, communication systems, and flexible manufacturing systems. The success or failure of the design and operation of such systems is judged by the degree to which performance objective are met. Thus, tool and techniques for predicting their performance measures have received great attention in the research and development communities since early 1900s.

Keywords

Service Time Queue Length Service Discipline Queueing Network Queue Length Distribution 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

1.5.1 Books on queueing theory and queueing systems

  1. Cohen, J.W The Single Server Queue, North Holland Publishing Company, Amsterdam, 1969.Google Scholar
  2. Kant, K. Introduction to Computer System Performance Evaluation. McGraw-Hill, 1992.Google Scholar
  3. Kelly, F.P. Reversibility and Stochastic Networks. Wiley, 1979.Google Scholar
  4. Kleinrock, L. Queueing Systems. Vol. 1: Theory. Wiley, 1975.Google Scholar
  5. Lavenberg, S.S. Computer Performance Modeling Handbook. Prentice Hall, 1983.Google Scholar

1.5.2 Surveys, tutorials, and books on queueing networks with blocking

  1. Akyildiz, I.F. and H.G. Perros Special Issue on Queueing Networks with Finite Capacity Queues, Performance Evaluation, Vol. 10, 3 (1989).Google Scholar
  2. Balsamo, S. “Properties and analysis of queueing network models with finite capacities”, in Performance Evaluation of Computer and Communication Systems (L. Donatiello, R. Nelson Eds.) Lecture Notes in Computer Science, 729, 1994, Springer-Verlag.Google Scholar
  3. 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
  4. Onvural, R.O “Survey of Closed Queueing Networks with Blocking” ACM Computing Surveys, Vol. 22, 2 (1990) 83–121.Google Scholar
  5. Onvural, R.O. Special Issue on Queueing Networks with Finite Capacity, Performance Evaluation, Vol. 17, 3 (1993).CrossRefGoogle Scholar
  6. Perros, H.G. “Open queueing networks with blocking” in Stochastic Analysis of Computer and Communications Systems (Takagi Ed.) North Holland, 1989.Google Scholar
  7. Perros, H.G. Queueing networks with blocking. Oxford University Press, 1994.Google Scholar

1.5.3 Publications on queueing networks

  1. Akyildiz, I.F. “Exact Product Form Solutions for Queueing Networks with Blocking” IEEE Trans. on Computers, Vol. 1 (1987) 121–126.Google Scholar
  2. Akyildiz, I.F. “General Closed Queueing Networks with Blocking” in Performance’87, (P.J. Courtois and G. Latouche Eds.), 282–303, Elsevier Science Publishers, North Holland, Amsterdam, 1988.Google Scholar
  3. Akyildiz, I.F. “On the Exact and Approximate Throughput Analysis of Closed Queueing Networks with Blocking” IEEE Trans. on Software Engineering, Vol. 14 (1988), 62–71.CrossRefGoogle Scholar
  4. Akyildiz, I.F. “Mean Value Analysis for Blocking Queueing Networks” IEEE Trans. on Software Engineering, Vol. 14 (1988) 418–429.CrossRefGoogle Scholar
  5. Akyildiz, I.F. “Product Form Approximations for Queueing Networks with Multiple Servers and Blocking” IEEE Trans. Computers, Vol. 38 (1989) 99–115.CrossRefGoogle Scholar
  6. Akyildiz, I.F. “Analysis of Queueing Networks with Rejection Blocking” in Proc. First International Workshop on Queueing Networks with Blocking, (H.G. Perros and T. Altiok Eds.), Elsevier Science Publishers, North Holland, Amsterdam, 1989.Google Scholar
  7. Akyildiz, I.F., and S. Kundu “Deadlock Free Buffer Allocation in Closed Queueing Networks” Queueing Systems Journal, 4 (1989) 47–56.CrossRefGoogle Scholar
  8. Akyildiz, I.F., and J. Liebeherr “Application of Norton’s Theorem on Queueing Networks with Finite Capacities” in Proc. INFOCOM 89, 914–923, 1989.Google Scholar
  9. Akyildiz, I.F., and H. Von Brand “Duality in Open and Closed Markovian Queueing Networks with Rejection Blocking” Tech. Rep., CS-87–0 11, (1987), Louisiana State University.Google Scholar
  10. Akyildiz, I.F., and H. Von Brand “Exact solutions for open, closed and mixed queueing networks with rejection blocking” J. Theor. Computer Science, 64 (1989) 203–219.CrossRefGoogle Scholar
  11. Akyildiz, I.F., and H. Von Brand “Computation of Performance Measures for Open, Closed and Mixed Networks with Rejection Blocking” Acta Informatica (1989)Google Scholar
  12. 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
  13. Allen, A.O. Probability, Statistics and Queueing Theory with Computer Science Applications. Academic Press, New York, 1990.Google Scholar
  14. Altiok, T., and H.G. Perros “Approximate Analysis of Arbitrary Configurations of Queueing Networks with Blocking” Annals of Oper. Res. 9 (1987) 481–509.CrossRefGoogle Scholar
  15. Ammar, M.H., and S.B. Gershwin “Equivalence Relations in Queueing Models of Fork/Join Networks with Blocking” Performance Evaluation, Vol. 10 (1989) 233–245.CrossRefGoogle Scholar
  16. Balsamo, S., and C. Clò “A Convolution Algorithm for Product Form Queueing Networks with Blocking” Annals of Operations Research, Vol. 79 (1998) 97–117.CrossRefGoogle Scholar
  17. Balsamo, S., V. De Nitto Personè, and G. Iazeolla “Identity and Reducibility Properties of Some Blocking and Non-Blocking Mechanisms in Congested Networks” in Flow Control of Congested Networks, (A.R. Odoni, L. Bianco, G. Szego Eds.), NATO ASI Series, Comp. and System Science, Vol.F38, Springer-Verlag, 1987.Google Scholar
  18. 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
  19. 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
  20. 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
  21. 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
  22. Balsamo, S., and G. Iazeolla “Some Equivalence Properties for Queueing Networks with and without Blocking” in Performance ’83 (A.K. Agrawala, S.K. Tripathi Eds.) North Holland, 1983Google Scholar
  23. 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, 22 (1975) 248–260.CrossRefGoogle Scholar
  24. Boxma, O., and A.G. Konheim “Approximate analysis of exponential queueing systems with blocking” Acta Informatica, 15 (1981) 19–66.CrossRefGoogle Scholar
  25. 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. 5 (1979) 631–642.CrossRefGoogle Scholar
  26. Chandy, K.M., U. Herzog, and L. Woo “Parametric analysis of queueing networks” IBM J. Res. Dev., 1 (1975) 36–42.CrossRefGoogle Scholar
  27. Chandy, K.M., and C.H. Sauer “Approximate Methods for Analyzing Queueing Network Models of Computing Systems” ACM Computing Surveys Vol. 10 (1978) 281–317.CrossRefGoogle Scholar
  28. Coffman, E.G., M.J. Elphick, and A. Shoshani “System Deadlocks” ACM Computing Surveys, Vol. 2 (1971) 67–78.CrossRefGoogle Scholar
  29. Cohen, J.W The Single Server Queue, North Holland Publishing Company, Amsterdam, 1969.Google Scholar
  30. Courtois, P. J. Decomposability: Queueing and Computer System Applications, Academic Press, Inc, New York, 1977.Google Scholar
  31. Cox, D.R. “A Use of Complex Probabilities in the Theory of Stochastic Processes” in Proc. Cambridge Philosophical Society, 51 (1955) 313–319.CrossRefGoogle Scholar
  32. 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
  33. 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
  34. De Nitto Personè, V. “Topology related index for performance comparison of blocking symmetrical networks” European J. of Oper. Res., Vol. 78 (1994) 413–425.CrossRefGoogle Scholar
  35. De Nitto Personè, V., and D. Grillo “Managing Blocking in Finite Capacity Symmetrical Ring Networks” in Proc. 3rd Conference on Data and Communication Systems and Their Performance, Rio de Jenerio, Brasil, 1987.Google Scholar
  36. De Nitto Personè, V., and V. Grassi “An analytical model for a parallel fault-tolerant computing system” Performance Evaluation, Vol. 38 (1999) 201–218.CrossRefGoogle Scholar
  37. Diehl, G.W. “A Buffer Equivalency Decomposition Approach to Finite Buffer Queueing Networks” Ph.D. thesis, Eng. Sci., Harvard University, 1984.Google Scholar
  38. Gelenbe, E., and I. Mitrani. Analysis and Synthesis of Computer Systems. Academic Press, Inc., London, 1980.Google Scholar
  39. Gershwin, S., and U. Berman “Analysis of Transfer Lines Consisting of Two Unreliable Machines with Random Processing Times and Finite Storage Buffers” AIIE Trans., 1 Vol. 3- (1981) 2–11.CrossRefGoogle Scholar
  40. Gordon, W.J., and G.F. Newell “Cyclic queueing systems with restricted queues” Oper. Res., Vol. 15 (1967) 286–302.CrossRefGoogle Scholar
  41. Gordon, W.J., and G.F. Newell “Cyclic queueing systems with Exponential Servers” Oper. Res., Vol. 15 (1967) 254–265.CrossRefGoogle Scholar
  42. Gross, D., and C.M. Harris. Fundamentals of Queueing Theory. John Wiley and Sons, Inc., New York, 1974.Google Scholar
  43. Highleyman, W. H. Performance Analysis of Transaction Processing Systems. Prentice Hall, Inc., Englewood Cliffs, New Jersey, 1989.Google Scholar
  44. 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
  45. Hordijk, A., and N. Van Dijk “Adjoint Processes, Job Local Balance and Insensitivity of Stochastic Networks”, Bull: 44 session, Int. Stat. Inst., Vol. 50 (1982) 776–788.Google Scholar
  46. 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 Proc. Int. Conf. Modeling Comput. Sys., 60 (1983) 158–205.Google Scholar
  47. Jackson, J.R. “Jobshop-like Queueing Systems” Mgmt. Sci., Vol. 10 (1963) 131–142.CrossRefGoogle Scholar
  48. Jennings, A. Matrix Computation for Engineers and Scientists. John Wiley and Sons, Inc., New York, 1977.Google Scholar
  49. Jun, K.P. “Approximate Analysis of Open Queueing Networks with Blocking”, Ph.D. thesis, Operations Research Program, North Carolina State University, 1988.Google Scholar
  50. Kelly, K.P. Reversibility and Stochastic Networks. John Wiley and Sons Ltd., Chichester, England, 1979.Google Scholar
  51. Kendall, D. G. “Stochastic Processes Occurring in the Theory of Queues and Their Analysis by the Method of Imbedded Markov Chains” Ann. Math. Statist., 24 (1953) 338–354CrossRefGoogle Scholar
  52. Kleinrock, L. Queueing Systems-Vol. II, John Wiley and Sons, New York, 1976.Google Scholar
  53. Kouvatsos, D.D. “Maximum Entropy Methods for General Queueing Networks” in Proc. Modeling Tech. and Tools for Perf. Analysis, (Potier Ed.), North Holland, Amsterdam, 1983, 589–608.Google Scholar
  54. Kouvatsos, D.D., and N.P. Xenios “Maximum Entropy Analysis of General Queueing Networks with Blocking”, in First International Workshop on Queueing Networks with Blocking, Perros and Altiok (Eds), Elsevier Science Publishers, North Holland, 1989.Google Scholar
  55. Law, A.M., and W.D. Kelton Simulation Modeling and Analysis. Mc Graw Hill, New York, 1982.Google Scholar
  56. Little, J.D.C. “A Proof of the Queueing Formula L=λW” Oper. Res., Vol. 9 (1961) 383–387CrossRefGoogle Scholar
  57. Marie, R. “An Approximate Analytical Method for General Queueing Networks” IEEE Trans. on Software Engineering, Vol. 5 (1979) 530–538.CrossRefGoogle Scholar
  58. Minoura, T. “Deadlock Avoidance Revisited” Journal of ACM, Vol. 29 (1982) 1023–1048.CrossRefGoogle Scholar
  59. Mitra, D., and I. Mitrani “Analysis of a Novel Discipline for Cell Coordination in Production Lines” AT&T Bell Labs Res. Rep., 1988.Google Scholar
  60. Muntz, R.R. “Queueing Networks: A Critique of the State of the Art Directions for the Future” ACM Comp. Surveys, Vol. 10 (1978) 353–359.CrossRefGoogle Scholar
  61. Onvural, R.O. “Closed Queueing Networks with Finite Buffers” Ph.D. thesis, CSE/OR, North Carolina State University, 1987.Google Scholar
  62. Onvural, R.O. “On the Exact Decomposition of Exponential Closed Queueing Networks with Blocking” in First International Workshop on Queueing Networks with Blocking, (H.G. Perros and T. Altiok Eds), Elsevier Science Publishers, North Holland, 1989.Google Scholar
  63. Onvural, R.O. “Some Product Form Solutions of Multi-Class Queueing Networks with Blocking” Performance Evaluation, Special Issue on Queueing Networks with Blocking, Akyildiz and Perros (Eds), 1989.Google Scholar
  64. Onvural, R.O., and H.G. Perros “On Equivalencies of Blocking Mechanisms in Queueing Networks with Blocking” Oper. Res. Letters, Vol. 5 (1986) 293–298.CrossRefGoogle Scholar
  65. Onvural, R.O., and H.G. Perros “Equivalencies Between Open and Closed Queueing Networks with Finite Buffers” in Proc. International Seminar on the Performance Evaluation of Distributed and Parallel Systems, Kyoto, Japan. Also to appear in Performance Evaluation, 1988.Google Scholar
  66. 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
  67. Onvural, R.O., and H.G. Perros “Throughput Analysis in Cyclic Queueing Networks with Blocking” IEEE Trans. Software Engineering, Vol. 15 (1989) 800–808.CrossRefGoogle Scholar
  68. Perros, H.G. “Queueing Networks with Blocking: A Bibliography” ACM Sigmetrics, Performance Evaluation Review, Vol. 12 (1984) 8–12.CrossRefGoogle Scholar
  69. Perros, H.G. “Open Queueing Networks with Blocking” in Stochastic Analysis of Computer and Communications Systems, (Takagi Ed.), Elsevier Science Publishers, North Holland, 1989.Google Scholar
  70. Perros, H.G., A. Nilsson, and Y.C. Liu “Approximate Analysis of Product Form Type Queueing Networks with Blocking and Deadlock” Performance Evaluation (1989).Google Scholar
  71. 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
  72. Reiser, M. “A Queueing Network Analysis of Computer Communications Networks with Window Flow Control” IEEE Trans. on Comm., Vol. 27 (1979) 1199–1209.CrossRefGoogle Scholar
  73. Sereno, M. “Mean Value Analysis of product form solution queueing networks with repetitive service blocking” Performance Evaluation, Vol. 36–37 (1999) 19–33.CrossRefGoogle Scholar
  74. Shanthikumar, G.J., and D.D. Yao “Monotonicity Properties in Cyclic Queueing Networks with Finite Buffers” in First International Workshop on Queueing Networks with Blocking, (H.G. Perros and T. Altiok Eds), Elsevier Science Publishers, North Holland, 1989.Google Scholar
  75. Solomon, S.L. Simulation of Waiting Line Systems. Prentice Hall, Englewood Cliffs, New Jersey, 1983.Google Scholar
  76. Suri, R., and G.W. Diehl “A New Building Block for Performance Evaluation of Queueing Networks with Finite Buffers” in Proc. ACM Sigmetrics on Measurement and Modeling of Computer Systems (1984) 134–142.Google Scholar
  77. Suri, R., and G.W. Diehl “A Variable Buffer Size Model and Its Use in Analytical Closed Queueing Networks with Blocking” Management Science, Vol. 32 (1986) 206–225.CrossRefGoogle Scholar
  78. Trivedi, K.S. Probability and Statistics with Reliability, Queueing and Computer Science Applications. Prentice Hall, Englewood Cliffs, New Jersey, 1982.Google Scholar
  79. 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
  80. Whitt, W. “Open and Closed Models for Networks of Queues” AT&T Bell Labs Tec. J., Vol. 63 (1984) 1911–1979.Google Scholar
  81. Yao, D.D., and J.A. Buzacott “Modeling a Class of State Dependent Routing in Flexible Manufacturing Systems” Annals of Operations Research, Vol. 3 (1985) 153–167.CrossRefGoogle Scholar
  82. Yao, D.D., and J.A. Buzacott “Queueing Models for Flexible Machining Station Part I: Diffusion Approximation” Eur. J. Operations Research, Vol. 19 (1985) 233–240.CrossRefGoogle Scholar
  83. Yao, D.D., and J.A. Buzacott “Queueing Models for Flexible Machining Stations Part II: The Method of Coxian Phases” Eur. J. Operations Research, Vol. 19 (1985) 241–252.CrossRefGoogle Scholar
  84. Yao, D.D., and J.A. Buzacott “The Exponentialization Approach to Flexible Manufacturing System Models with General Processing Times” Eur. J. of Operations Research, Vol. 24 (1986) 410–416.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