Abstract
This chapter was an introduction to the queueing models. The first part of the chapter introduced very basic concepts including Little’s law, Poisson Arrivals See Time Averages, and the Kendall’s notation for the classification of the queueing models. In the second part of the chapter, the balance equations for a general B&D queueing model, and the balance equations and Little’s law equations for an M/M/1 queueing model with infinite capacity and finite capacity have been provided. The adaptation of the basic formulations to the cases with more than one server, with varying arrival rates and departure rates, and with finite capacity has been illustrated with some examples and problems including the ones related to the arrivals of the customers, and the arrivals of the machines to a repair system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
This problem and its solution approach have been borrowed from Introduction to Probability Models by Sheldon Ross.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Bas, E. (2019). An Introduction to Queueing Models. In: Basics of Probability and Stochastic Processes. Springer, Cham. https://doi.org/10.1007/978-3-030-32323-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-32323-3_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-32322-6
Online ISBN: 978-3-030-32323-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)