OVERVIEW

The class aims at the introduction of the basic elements for understanding and applying the mathematical instruments commonly utilized for performance analysis of telecommunication networks and for teletraffic engineering.

AIMS AND CONTENT

LEARNING OUTCOMES

The class aims to provide the bases to understand and use analytical models of telecommunication networks, wihch can be adopted for performance evaluation and control purposes. Elementary queueing models of the birth-death type will be examined in detali, along with Markov Chains, one instance of semi-Markov sytems (M/G/1), and open queueing networks. The student will be able to use the analytical tools in modeling and analysis of networking devices and networks, and to implement them in numerical computer calculations.

AIMS AND LEARNING OUTCOMES

The main goal of the class is to provide the elements for understanding and applying queueing models for the representation, performance analysis and control of telecommunication networks. At the end of the class the student should be able to to use dynamic models based on Markov chains and Markovian queueing models in equilibrium, as well as to represent and evaluate various performance indexes of telecommunication networks (throughput, delay, loss probability).

PREREQUISITES

To understand the topics covered, some knowledge is required of basic Mathematical Analysis, Probability Theory and Random Variables (discrete and continuous).

TEACHING METHODS

The class is taught basically with face-to-face lectures. Numerous exercizes will be solved, relating to the application of the methodology to the derivation of performance indexes of networks and network elements. The exam consists of a written problem solution, along with the oral discussion of it. The written part can be substituted by the positive completion of the periodic tests that might be proposed during the class. Working students and students with a certification of Specific Learning Disturbances (DSA), disabilty or other special educational needs are advised to contact the lecturer at the beginning of the class to agree upon teaching and verification modalities that, respecting anyway the course objectives, may be tailored to the individual learning capabilities.

Students with valid certifications for Specific Learning Disorders (SLDs), disabilities or other educational needs are invited to contact the teacher and the School's contact person for disability at the beginning of teaching to agree on possible teaching arrangements that, while respecting the teaching objectives, take into account individual learning patterns. Contacts of the teacher and the School's disability contact person can be found at the following link Comitato di Ateneo per l’inclusione delle studentesse e degli studenti con disabilità o con DSA | UniGe | Università di Genova

SYLLABUS/CONTENT

Methods of network performance evaluation: analytical models, simulation, experimental measurements. Packet-level and flow-level models. Elementary queueing theory: elements of a queue, statistics of input and service, general results on infinite- and finite-buffer queues, Little’s Theorem, Kendall’s notation. Markovian queues in equilibrium: properties of the exponential distribution, Poisson process, stationary distribution of general birth-death systems, M/M/1, M/M/1/K, M/M/infinity, M/M/m/m, M/M/m, M/M/m/m/N. Discrete- and continuous-time Markov Chains. M/G/1 queue. Pollaczek-Kinchin formula. Pareto distribution and M/Pareto/1. Server vacation. M/G/1 with pre-emptive priority. Networks of queues. Jackson networks, Product Form Solution, independence hypothesis, Kleinrock’s delay formula and applications.

RECOMMENDED READING/BIBLIOGRAPHY

The class is based on the first part of the lecture notes on Aulaweb:

- F. Davoli, "Lecture Notes for the Courses of Telecommunication Networks: Queueing Theory and Teletraffic", 2nd ed., July 2021.

Other useful material can be found on:

- L. Kleinrock, Queueing Systems, Vol. I, Wiley, New York, 1975.

- M. Zukerman, Introduction to Queueing Theory and Stochastic Teletraffic Models, 2017; online: https://arxiv.org/pdf/1307.2968.pdf.

- J. Virtamo, Queueing Theory, Lecture Notes, 2005; online: http://www.netlab.tkk.fi/opetus/s383143/kalvot/english.shtml.

LESSONS

LESSONS START

https://corsi.unige.it/10378/p/studenti-orario

Class schedule

The timetable for this course is available here: Portale EasyAcademy

EXAMS

EXAM DESCRIPTION

The exam is written and usually consists of two problems on the topics of the class. The student who wants to improve the mark of the written test can do an oral that consists of a discussion of some of the topics relating to the written problems. Obviously, depending on the outcome, the mark obtained in the written part may also decrease.

ASSESSMENT METHODS

Written examination.

FURTHER INFORMATION

Students with valid certifications for Specific Learning Disorders (SLDs), disabilities or other educational needs are invited to contact the teacher and the School's contact person for disability at the beginning of teaching to agree on possible teaching arrangements that, while respecting the teaching objectives, take into account individual learning patterns. Contacts of the teacher and the School's disability contact person can be found at the following link Comitato di Ateneo per l’inclusione delle studentesse e degli studenti con disabilità o con DSA | UniGe | Università di Genova