Politecnico di Torino
Politecnico di Torino
   
Login  
it
Politecnico di Torino
Academic Year 2007/08
01GTKHR, 01GTKBP, 01GTKHZ, 01GTKKY, 01GTKKZ
Traffic theory
Master of science-level of the Bologna process in Computer And Communication Networks Engineering - Torino
Master of science-level of the Bologna process in Telecommunication Engineering - Torino
1st level specializing master in Information And Communications Technologies - Torino
Espandi...
Teacher Status SSD Les Ex Lab Tut Years teaching
Leonardi Emilio ORARIO RICEVIMENTO O2 ING-INF/03 5 0 0 0 2
SSD CFU Activities Area context
ING-INF/03 5 B - Caratterizzanti Ingegneria delle telecomunicazioni
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 packet-switched) are used as case studies during the course. The course starts with a review of main results on the characterization and the analysis of Markov stochastic processes with discrete state space (Markov chains). Elementary Markovian queuing system are then described, and their application in modelling and dimensioning telecommunication and computer network elements are discussed. Finally, networks of queues are studied, with particular attention to networks that admit product-form solutions.
Prerequisiti

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









Written exam, in which students are asked to solve problems similar to those of problem solving sessions taken during classes.
Syllabus
Main course topics:
' Review of random variables and stochastic processes
' Discrete-time and continuous-time Markov chains
' Elementary renewal theory
' Elementary reversibility theory
' Isolated Markovian queues
' Erlang formulas; Engset 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 for the delay in packet networks
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.

Programma definitivo per l'A.A.2008/09
Back



© Politecnico di Torino
Corso Duca degli Abruzzi, 24 - 10129 Torino, ITALY
WCAG 2.0 (Level AA)
Contatti