The slides are updated continuously as the course goes. The recordings will not be updated. They are from 2021 and may contain irrelevant administrative information. As for dates, consider always the ones given for this course round.

Reading suggestions: V1:1-3, 5-7 means the Virtamo notes, section 1: pages 1 to 3 and 5 to 7; N1.1-3 means the Nain notes sections 1.1 to 1.3. All ranges are inclusive final page or section.

Introduction and probability theory recap

Course and queuing theory introduction

Theory: Slides, Recording, Reading: V9:1-7

Probability theory recap

Theory: Notes, Recording, Reading: V1:1-21, V2:1-19,V3:1-19

More detailed introduction: see this page

Poisson process and Markov chains

Poisson process

Theory: Slides, Recording, Reading: V7:1-15

Problem solving: Notes Recording, Problem set Chapters 1 and 2: 1.3, 1.5, 1.6, 2.3, 2.4, 2.6

Markov chains

Theory: Slides, Recording, Reading: V4:1-6, V5:1-8, V6:1-9, N1,1.2,1.3

Problem solving: Notes, Recording, Problem set Chapter 3: 3.2, 3.3, 3.4, 3.5 (more under the next problem solving part)

Queuing systems and M/M/1 queues

Queuing systems

Theory: Slides, Transforms_notes, Recording, Reading: V8:1-7, V9:1-7, N2.6

Problem solving: Notes Recording, Problem set Chapters 3 and 4: 3.6, 4.1, 4.5, extra problem

M/M/1 queues

Theory: Summary slides , Notes, Recording, Reading: V12:1-12, N2.1

Problem solving: Notes Recording Problem set Chapter 5: 3.1, 5.2, 5.5

Erlang and Engset queues

Erlang queues (M/M/m/m and M/M/m)

Theory: Notes, Recording_1 Recording_2, Reading: V10:1-10, N2.4, V12:13-20, N2.3-7

Problem solving: Notes , Recording, Problem set Chapter 6: 5.6, 6.2, 6.5, 6.6, exam problem 3. (M/M/m problems in the next recitation.)

Engset loss system (M/M/m/m/C)

Theory: Slides, Notes, Recording, Reading: V11:1-11

Problem solving: Notes , Recording, Problem set Chapters 7, 8: 7.1, 7.6, 8.4.

Semi- and non-Markovian queues

Er, Hr queues

Theory: Slides, Notes, Recording, Reading: Kleinrock extracts

Problem solving: Notes, Recording, Problem set Chapter 9: 9.1, 9.2, exam problem 6

M/G/1 queues

Theory: Slides , Notes, Recording, Reading: V13:1-25, N2.8

Problem solving: Notes, Recording, Problem set Chapter 10: 10.1, 10.2, 10.4, exam problem 9

Vacation, priority and queuing networks

Vacation and Priority

Theory: Slides, Notes, Recording, Reading: V14:1-10, N3

Problem solving: Notes , Recording. Problem set Chapter 11: 11.3, 11.5 and missing problem on vacation systems

Queuing Networks

Theory: Slides , Notes, Recording, Reading: V15:1-5,9-12, N4.1

Problem solving: Notes, Recording, Problem set Chapter 12: 12.2, 12.3 and an exam problem.

Summary and preparation for the exam

Summary and exam problem examples

Theory: Slides, Recording (The slides are updated with 2024 specific information. The recording contains old information abut the exam details!)

Problem solving: Practice problems and Solutions from 2021.