Introduction to Queueing Theory

Queueing theory is a rich branch of mathematics. In the last 20 years, it has found its way into computer science, especially, the performance evaluation field.

In this chapter, we will introduce some of the basic concepts and tools in the queueing theory and discuss how they can be used in performance evaluation.

---

• Queueing Notations
  • Kendall Notation
• Rules For All Queues
• Types of Stochastic Processes
• An Example
• State Diagrams
• Single Queue, Single Server with Limited Buffer Size
  • Buffer of Size Three
  • Buffer of Size k
• Single Queue, Two Server with Unlimited Buffer
• Two Queue, Two Server System
• An Example
• M/M/m Queue
• M/M/m/B Queue With Finite Buffers

---

 

Xiannong Meng
Thu Nov 18 13:34:50 CST 1999