Start

Welcome to Queuing Theory and Teletraffic Systems

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 classical theory for queuing systems with an emphasis on models for telecommunication and computer communication.

Topics include: 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, Jackson 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.

Examination: the course consists of two moments, homework assignments and small project (1.5 ECTS) and written exam (6 ECTS). You pass the course if you pass both of these moments. You get your grade based on the written exam.

Welcome!