Queueing Models

  • Thomas G. Robertazzi
  • Li Shi


Queueing theory models things waiting in lines. Such things include packets, telephone calls or computer jobs. Continuous time and discrete time single queues are reviewed. This includes M/M/1, Geom/Geom/1 and M/G/1 results. Networks of Markovian queues along with the mean value analysis (MVA) computational algorithm are discussed. Negative customer networks are examined. Recursive solutions for certain non-product form networks are covered. Stochastic Petri networks (SPN) with product form solutions are also considered. General solution techniques for these models are outlined.


Queue Queueing networks Mean value analysis Negative customers Recursive solutions Stochastic Petri networks 


  1. 15.
    J.R. Artalejo, “G-networks: A Versatile Approach for Work Removal in Queueing Networks,” European Journal of Operations Research, vol. 126, issue 2, Oct. 2000, pp. 233–249.Google Scholar
  2. 22.
    F. Baskett, K.M. Chandy, R.R. Muntz and F. Palacios, “Open, Closed and Mixed Networks of Queues with Different Classes of Customers,” Journal of the ACM, vol. 22, no. 2, April 1975, pp. 248–260.Google Scholar
  3. 54.
    S.C. Bruell and G. Balbo, Computational Algorithms for Closed Queueing Networks, North-Holland, N.Y. 1980.zbMATHGoogle Scholar
  4. 55.
    J.P. Buzen, “Computational Algorithms for Closed Queueing Networks with Exponential Servers,” Communications of the ACM, vol. 16, no. 9, Sept. 1973, pp. 527–531.Google Scholar
  5. 61.
    X. Chao and M. Pinedo, “On G-Networks: Queues with Positive and Negative Arrivals,” Probability in the Engineering and Information Sciences, 1993.Google Scholar
  6. 74.
    E. W. Dijkstra, “Cooperating Sequential Processes,” in F. Genuys, editor, Academic Press, 1983.Google Scholar
  7. 75.
    R. Disney, Traffic Processes in Queueing Networks: A Markov Renewal Approach, The Johns Hopkins University Press, Baltimore MD, 1987.zbMATHGoogle Scholar
  8. 95.
    (a) E. Gelenbe, “Product Form Networks with Negative and Positive Customers,” Journal of Applied Probability, vol. 28, 1991, pp. 656–663.Google Scholar
  9. 96.
    (b) E. Gelenbe, P. Glynn and K. Sigman, “Queues with Negative Arrivals,” Journal of Applied Probability, vol. 28, 1991, pp. 245–250.Google Scholar
  10. 104.
    D. Goodman and R. Yates, Probability and Stochastic Processes, 2nd ed., Wiley, 2004.Google Scholar
  11. 105.
    W.J. Gordon and G.F. Newell, “Closed Queueing Systems with Exponential Servers,” Operations Research, vol. 15, 1967, pp. 254–265.CrossRefGoogle Scholar
  12. 107.
    D. Gross and C.M. Harris, Fundamentals of Queueing Theory, Wiley, New York, 1974, 1985.Google Scholar
  13. 111.
    J.L. Hammond and P.J.P. O’Reilly, Performance Analysis of Local Computer Networks, Addison-Wesley, Reading, Mass. 1986.Google Scholar
  14. 112.
    U. Herzog, L. Woo and K.M. Chandy, “Solution of Queueing Problems by a Recursive Technique,” IBM Journal of Research and Development, May 1975, pp. 295–300.Google Scholar
  15. 126.
    J.R. Jackson, “Networks of Waiting Lines,” Operations Research, vol. 5, 1957, pp. 518–521.MathSciNetCrossRefGoogle Scholar
  16. 133.
    J.S. Kaufman, “Blocking in a Shared Resource Environment,” IEEE Transactions on Communications, vol. COM-29, no. 10, Oct. 1981, pp. 1474–1481.Google Scholar
  17. 134.
    D.G. Kendall, “Some Problems in the Theory of Queues,” Journal of the Royal Statistical Society, series B, vol. 13, no. 2, 1951, pp. 151–185.Google Scholar
  18. 135.
    P. Kermani and L. Kleinrock, “Virtual Cut-Through: A New Computer Communications Switching Technique,” Computer Networks, vol. 3, 1979, pp. 267–286.MathSciNetzbMATHGoogle Scholar
  19. 136.
    A.Y. Khinchin, “Mathematisches uber die Erwatung vor einem offentlichen Schalter,” in English “Mathematical Theory of Stationary Queues,” Matem. Sbornik, vol. 39, 1932, pp. 73–84.Google Scholar
  20. 140.
    L. Kleinrock, Queueing Systems, vol. I and II, Wiley, New York, 1975.zbMATHGoogle Scholar
  21. 145.
    H. Kobayashi, Modeling and Analysis: An Introduction to System Performance Evaluation, Addison-Wesley, Reading, Mass. 1978.zbMATHGoogle Scholar
  22. 150.
    A.A. Lazar and T.G. Robertazzi, “Markovian Petri Net Protocols with Product Form Solution,” Performance Evaluation, vol. 12, 1991, pp. 67–77.MathSciNetCrossRefGoogle Scholar
  23. 165.
    M.A. Marsan, G. Balbo, G. Conte and F. Gregoretti, “Modeling Bus Contention and Memory Interference in a Multiprocessor System,” IEEE Transactions on Computers, vol. C-32, no. 1, 1983, pp. 60–72.CrossRefGoogle Scholar
  24. 166.
    M.A. Marsan, G. Balbo and G. Conte, Performance Models of Multiprocessor Systems, The MIT Press, 1986.Google Scholar
  25. 168.
    H. Michiel and K. Laevens, “Teletraffic Engineering in a Broad-Band Era,” Proc. of the IEEE, vol. 85, no. 12, Dec. 1997, pp. 2007–2033.Google Scholar
  26. 176.
    A. Papoulis and S.U. Pillai, Probability, Random Variables and Stochastic Processes, McGraw-Hill, 2002.Google Scholar
  27. 181.
    C.A. Petri, Kommunikation mit Automaten, Ph.D Thesis, University of Bonn, Germany, 1962.Google Scholar
  28. 185.
    F. Pollaczek, “Uber eine Aufgabe dev Wahrscheinlichkeitstheorie,” Math. Zeitschrift, vol. 32, 1930, pp. 64–100, 729–750.Google Scholar
  29. 188.
    M. Reiser and H. Kobayashi, “Recursive Algorithms for General Queueing Networks with Exponential Servers,” IBM Research Report RC 4254, Yorktown Heights NY, 1973.Google Scholar
  30. 189.
    M. Reiser and S.S. Lavenberg, “Mean-value Analysis of Closed Multichain Queueing Networks,” Journal of the ACM, vol. 27, no. 2, April 1980, pp. 313–322.Google Scholar
  31. 194.
    T.G. Robertazzi, Computer Networks and Systems: Queueing Theory and Performance Evaluation, 3rd edition., Springer-Verlag, NY, NY, 2000.CrossRefGoogle Scholar
  32. 202.
    K.W. Ross, Multiservice Loss Models for Broadband Telecommunication Networks, Spring Verlag, NY, NY, 1995.CrossRefGoogle Scholar
  33. 208.
    M. Schwartz, Telecommunication Networks: Protocols, Modeling and Analysis, Addison-Wesley, Reading, Mass., 1987.Google Scholar
  34. 234.
    (a) I.Y. Wang and T.G. Robertazzi, “Recursive Computation of Steady State Probabilities of Non-Product Form Queueing Networks Associated with Computer Network Models,” IEEE Transactions on Communications, vol. 38, no. 1, Jan. 1990, pp. 115–117.Google Scholar
  35. 242.
    M.E. Woodward, Communication and Computer Networks: Modelling with Discrete-Time Queues, Wiley and IEEE Computer Society Press, 1983.Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Thomas G. Robertazzi
    • 1
  • Li Shi
    • 1
  1. 1.Stony Brook UniversityStony BrookUSA

Personalised recommendations