Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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.
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.
S.C. Bruell and G. Balbo, Computational Algorithms for Closed Queueing Networks, North-Holland, N.Y. 1980.
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.
X. Chao and M. Pinedo, “On G-Networks: Queues with Positive and Negative Arrivals,” Probability in the Engineering and Information Sciences, 1993.
E. W. Dijkstra, “Cooperating Sequential Processes,” in F. Genuys, editor, Academic Press, 1983.
R. Disney, Traffic Processes in Queueing Networks: A Markov Renewal Approach, The Johns Hopkins University Press, Baltimore MD, 1987.
(a) E. Gelenbe, “Product Form Networks with Negative and Positive Customers,” Journal of Applied Probability, vol. 28, 1991, pp. 656–663.
(b) E. Gelenbe, P. Glynn and K. Sigman, “Queues with Negative Arrivals,” Journal of Applied Probability, vol. 28, 1991, pp. 245–250.
D. Goodman and R. Yates, Probability and Stochastic Processes, 2nd ed., Wiley, 2004.
W.J. Gordon and G.F. Newell, “Closed Queueing Systems with Exponential Servers,” Operations Research, vol. 15, 1967, pp. 254–265.
D. Gross and C.M. Harris, Fundamentals of Queueing Theory, Wiley, New York, 1974, 1985.
J.L. Hammond and P.J.P. O’Reilly, Performance Analysis of Local Computer Networks, Addison-Wesley, Reading, Mass. 1986.
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.
J.R. Jackson, “Networks of Waiting Lines,” Operations Research, vol. 5, 1957, pp. 518–521.
J.S. Kaufman, “Blocking in a Shared Resource Environment,” IEEE Transactions on Communications, vol. COM-29, no. 10, Oct. 1981, pp. 1474–1481.
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.
P. Kermani and L. Kleinrock, “Virtual Cut-Through: A New Computer Communications Switching Technique,” Computer Networks, vol. 3, 1979, pp. 267–286.
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.
L. Kleinrock, Queueing Systems, vol. I and II, Wiley, New York, 1975.
H. Kobayashi, Modeling and Analysis: An Introduction to System Performance Evaluation, Addison-Wesley, Reading, Mass. 1978.
A.A. Lazar and T.G. Robertazzi, “Markovian Petri Net Protocols with Product Form Solution,” Performance Evaluation, vol. 12, 1991, pp. 67–77.
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.
M.A. Marsan, G. Balbo and G. Conte, Performance Models of Multiprocessor Systems, The MIT Press, 1986.
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.
A. Papoulis and S.U. Pillai, Probability, Random Variables and Stochastic Processes, McGraw-Hill, 2002.
C.A. Petri, Kommunikation mit Automaten, Ph.D Thesis, University of Bonn, Germany, 1962.
F. Pollaczek, “Uber eine Aufgabe dev Wahrscheinlichkeitstheorie,” Math. Zeitschrift, vol. 32, 1930, pp. 64–100, 729–750.
M. Reiser and H. Kobayashi, “Recursive Algorithms for General Queueing Networks with Exponential Servers,” IBM Research Report RC 4254, Yorktown Heights NY, 1973.
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.
T.G. Robertazzi, Computer Networks and Systems: Queueing Theory and Performance Evaluation, 3rd edition., Springer-Verlag, NY, NY, 2000.
K.W. Ross, Multiservice Loss Models for Broadband Telecommunication Networks, Spring Verlag, NY, NY, 1995.
M. Schwartz, Telecommunication Networks: Protocols, Modeling and Analysis, Addison-Wesley, Reading, Mass., 1987.
(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.
M.E. Woodward, Communication and Computer Networks: Modelling with Discrete-Time Queues, Wiley and IEEE Computer Society Press, 1983.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Robertazzi, T.G., Shi, L. (2020). Queueing Models. In: Networking and Computation. Springer, Cham. https://doi.org/10.1007/978-3-030-36704-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-36704-6_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-36703-9
Online ISBN: 978-3-030-36704-6
eBook Packages: EngineeringEngineering (R0)