


Politecnico di Torino  
Academic Year 2009/10  
01GTHBP Teletraffic theory I 

Master of sciencelevel of the Bologna process in Telecommunication Engineering  Torino 





Objectives of the course
The main goal of the course is to describe simple methodologies for the design and the performance analysis of telecommunication and computer networks. Examples taken from real networks (both circuit and packetswitched) are used as case studies during the course. The course starts with the description and the analysis of Markovian stochastic processes with discrete state space (Markov chains). Then, queuing theory is introduced, and models used to describe telecommunication and computer network elements are presented.

Prerequisites
Students' background must encompass elementary probability (random variables and random processes) and basic knowledge on telecommunication networks.

Syllabus
Main course topics:
' Stochastic processes ' Discretetime Markov chains ' Continuoustime Markov chains ' Isolated Markovian queues ' Erlang's formulas; Engset's formula ' Burke's theorem and acyclic Markovian queuing networks ' Open queuing networks (Jackson's networks) ' Closed queuing networks (Gordon and Newell's networks) ' BCMP theorem Kleinrock's formula 
Bibliography
Course notes will be available on the web site.
Main source for further reading: L. Kleinrock, Queueing Systems, Vol I, Wiley 1975 
Revisions / Exam
Written exam, in which students are asked to solve problems similar to those of problem solving sessions taken during classes.

