Skip to main content
Till KTH:s startsida Till KTH:s startsida

EP2200 Queuing Theory and Teletraffic Systems 7.5 credits

Note, eventuel collisions with other courses will be handled at the beginning of the course.

Queuing theory is the basis for performance evaluation and dimensioning of communication networks, computing systems, road traffic and transport systems, and other resource sharing systems, like digital health services.

This course treats queuing systems with an emphasis on the classical models. The theory is illustrated by problems drawn from communication and computing.

About course offering

For course offering

Spring 2025 Start 14 Jan 2025 programme students

Target group

Open for all master programs as long as it can be included in your programme.

Part of programme

Master's Programme, ICT Innovation, åk 1, CLNI, Conditionally Elective

Master's Programme, ICT Innovation, åk 1, CLNS, Conditionally Elective

Master's Programme, Information and Network Engineering, åk 1, Recommended

Master's Programme, Information and Network Engineering, åk 1, COE, Recommended

Master's Programme, Information and Network Engineering, åk 1, NWS, Mandatory


P3 (7.5 hp)


14 Jan 2025
16 Mar 2025

Pace of study


Form of study

Normal Daytime

Language of instruction


Course location

KTH Campus

Number of places

Min: 25

Planned modular schedule


For course offering

Spring 2025 Start 14 Jan 2025 programme students

Application code



For course offering

Spring 2025 Start 14 Jan 2025 programme students


Viktoria Fodor


No information inserted

Course coordinator

No information inserted


No information inserted
Headings with content from the Course syllabus EP2200 (Spring 2024–) are denoted with an asterisk ( )

Content and learning outcomes

Course contents

The classical theory of queueing systems: 

  • Discrete and continuous time Markov chains, birth-death processes, and the Poisson process.
  • Basic terminology of queuing systems, Kendall’s notation and Little’s theorem.
  • Markovian waiting systems with one or more servers, and systems with infinite as well as finite buffers and finite user populations (M/M/).
  • Systems with general service distributions (M/G/1):  the method of stages, Pollaczek-Khinchin mean-value formula and and systems with priority and interrupted service.
  • Loss systems according to Erlang, Engset and Bernoulli.
  • Open and closed queuing networks, Jacksonian networks.

The theory is illustrated by examples from telecommunication and computer communication such as blocking in circuit switched networks, preventive and reactive congestion control, and traffic control for guaranteeing quality of service.

Furthermore, students develop their skills to perform performance analysis of queuing systems and to present the results, using mathematical software and suitable text editors.

Intended learning outcomes

After passing the course, the student should be able to

  • explain the basic theory of Markov-processes and apply the theory to model queuing systems,
  • derive and use analytic models of of Markovian queuing systems, queuing networks and also some simpler non-Markovian systems,
  • explain and use results derived for complex non-Markovian systems,
  • define queuing models of communication or computer systems, and derive the performance of these systems,
  • use adequate tools to present scientific work,

in order to be able to carry out mathematical modeling based performance evaluation of communication, computing, or other resource sharing systems.

Literature and preparations

Specific prerequisites

Knowledge in basic probability theory and statistics, 6 credits, corresponding to completed course SF1912/SF1914/SF1915/SF1916/SF1920/SF1921/SF1922/SF1923/SF1924/SF1935.

Recommended prerequisites

SF1901 Probability Theory and Statistics, or similar. Basic knowledge in networking is helpful, but not mandatory.


No information inserted


No information inserted

Examination and completion

If the course is discontinued, students may request to be examined during the following two academic years.

Grading scale

A, B, C, D, E, FX, F


  • INL1 - Assignment, 1.5 credits, grading scale: P, F
  • TENA - Oral exam, 6.0 credits, grading scale: A, B, C, D, E, FX, F

Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.

The examiner may apply another examination format when re-examining individual students.

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

No information inserted


Ethical approach

  • All members of a group are responsible for the group's work.
  • In any assessment, every student shall honestly disclose any help received and sources used.
  • In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.

Further information

Course room in Canvas

Registered students find further information about the implementation of the course in the course room in Canvas. A link to the course room can be found under the tab Studies in the Personal menu at the start of the course.

Offered by

Main field of study

Computer Science and Engineering, Information and Communication Technology

Education cycle

Second cycle

Add-on studies

EP2300 Management of Networks and Networked Systems
EP2210 Performance analysis of communication networks


Viktoria Fodor

Transitional regulations

TEN1 is replaced by TENA.

Supplementary information

In this course, the EECS code of honor applies, see: