After successful completion of the course, students are able to

• list and interpret the elements of a queueing model,
• define Kendalls notation,
• state the recursion for waiting times,
• state conditions for the stability in the G/G/1 model framework,
  
• cite Little's result,
• analyze the elementary queues M/M/1, M/M/m and M/M/m/m,
  
• apply the method of embedded Markov chain to M/G/1 and G/M/s queues,
• describe the spectral decomposition method for G/G/1 queues,
• provide estimates and approximations for queueing models,
• apply the elementary queues and approximations for queueing models in areas such as
  computer science, financial mathematics or operations research.

Introduction to the queueing theory, Kendall's notation, recursion for waiting times, stability, Little's law, elementary queueing theory including birth–death process and M/M/1, M/M/m as well as M/M/m/m queues, analysis methods and stationary distributions for M/G/1, G/M/1, G/G/1 queues, bounds, heavy traffic approximation, diffusion approximation.

Lecture

oral exam

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

probability theory and stochastic processes