1st meeting: Preliminaries on the Poisson process, the exponential distribution and renewal theory. Little"s rule. The M/M/1 and the M/G/1 queueing models. Khintchine-Polazceck formula via mean value analysis 2nd meeting: Priority queues. Stand-by customers and externalities. Service length based priority queues. 3rd meeting: Preliminaries on discrete and continuous Markov chains. Limit probabilities and waiting times in the M/M/1, G/M/1 and M/G/1 models. 4th meeting: Closed and open networks of exponential queues. Limit probabilities and the arrival theorem. Mean value analysis and algorithms for deriving performance measures. 5th meeting: Symmetric and product form queues. Examples: processor sharing, loss systems and last-come first-served queues.