Introduction to Queueing Theory
A simple queueing system was first introduced in Chap.1 as an example of a DES. We have since repeatedly used it to illustrate many of the ideas and techniques discussed thus far. In this chapter, we will take a more in-depth look at queueing systems.
Queueing theory is a subject to which many books have been devoted. It ranges from the study of simple single-server systems modeled as birth—death chains to the analysis of arbitrarily complex networks of queues. Our main objective here is to present the essential ideas and techniques that are used to analyze simple queueing systems. The word “simple” in queueing theory is often associated with birth—death chain models which we have learned to analyze in the previous chapter. Thus, we will see that several interesting queueing systems can be viewed as special cases of these models. We will also provide some extensions necessary to deal with more complex situations involving event processes which do not satisfy the Markov property and with networks of queues connected in arbitrary ways.
KeywordsService Time Arrival Rate Queue Length Queueing System Interarrival Time
Unable to display preview. Download preview PDF.
- ∎ Bremaud, P., Point Processes and Queues, Springer-Verlag, 1981. Google Scholar
- ∎ Kleinrock, L., Queueing Systems, Volume I: Theory, Wiley, New York, 1975.Google Scholar
- ∎ Snowdon, J. L., and J. C. Ammons, “A Survey of Queueing Network Packages for the Analysis of Manufacturing Systems,” Manufacturing Review, Vol. 1, No. 1, pp. 14–25, 1988.Google Scholar
- ∎ Trivedi, K.S., Probability and Statistics with Reliability, Queuing and Computer Science Applications, Second Edition, Wiley, New York, 2001.Google Scholar