EP2200 Queuing Theory and Teletraffic Systems 7.5 credits

Köteori och teletrafiksystem

Queuing theory is the basis for performance evaluation and dimensioning of telecommunication and computer communication networks, road traffic systems, and transport systems in general. This course treats queuing systems with an emphasis on the classical models. The theory is illustrated by problems drawn from telecommunication and computer communication.

Show course information based on the chosen semester and course offering:

Offering and execution

No offering selected

Select the semester and course offering above to get information from the correct course syllabus and course offering.

Course information

Content and learning outcomes

Course contents *

This course includes the classical theory for queuing systems:

  • Basic terminology, Kendall’s notation and Little’s theorem.
  • Discrete and continuous time Markov chains, birth-death processes, and the Poisson process.
  • 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.

Intended learning outcomes *

The course gives a basic knowledge in modelling and analysis of queuing systems with applications to communication systems.

Course Disposition

No information inserted

Literature and preparations

Specific prerequisites *

For single course students: 120 credits and documented proficiency in English B or equivalent

Recommended prerequisites

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

Equipment

No information inserted

Literature

Meddelas på kursens hemsida

Examination and completion

Grading scale *

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

Examination *

  • INL1 - Assignment, 1.5 credits, Grading scale: P, F
  • TEN1 - Examination, 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.

Other requirements for final grade *

Written exam (TEN1; 5 cr)
Assignment (INL1; 1,5 cr)

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

No information inserted

Examiner

Viktoria Fodor

Further information

Course web

Further information about the course can be found on the Course web at the link below. Information on the Course web will later be moved to this site.

Course web EP2200

Offered by

EECS/Communication

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

Contact

Viktoria Fodor

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.

Supplementary information

In this course, the EECS code of honor applies, see: http://www.kth.se/en/eecs/utbildning/hederskodex.