After successful completion of the course, students are able to

• define the standard model and Kendalläs notation
• state the recursion for waiting times
• state conditions for the existence of stationary distributions  in the standard model
• cite Little's result
• analyze queues of type M/M/1 and other Markovian queues
• apply the embeeded Markov chain method to M/G/1 and G/M/s  queues
• describe the spectral decomposition method for G/G/1 queues
• describe bounds and approximations for queueing models
  

Introduction to the queueing theory  including Kendall's notation, stability, Little's law, birth–death process, stationary distributions for  M/M/1, M/G/1, G/M/1, G/G/1 queues, bounds, heavy traffic approximation, diffusion approximations.

Lecture

oral exam

Recommended literature: "L. Kleinrock, Queueing Systems, Vol. I: Theory"

probability theory and stochastic processes