Queueing Theory and Performance Analysis

1. Introduction and background knowledge
   1. Introduction to queueing theory; motivation and examples
   2. The Poisson process
   3. Markov chains, Markov processes and other necessary background
2. Birth-and-death type queues
   1. The M/M/1 queue
   2. The M/M/1-N queue
   3. The M/M/c queue
3. The M/G/1 queue
   1. Queue-length distribution
   2. Waiting-time distribution
   3. Busy period
4. Multi-class generalizations of the M/G/1 queue
   1. Conservation laws
   2. Queues with priorities
   3. Polling models
5. Networks of queues
   1. Jackson networks and product forms
   2. The Erlang loss model and the machine-repair model
   3. The Mean-Value-Analysis algorithm

Throughout the lectures, examples will be given of queueing phenomena
in every-day life: computer-communication systems, production networks,
road traffic.