Communications networks B - (5 cfu)

Prof. Alberto Bononi Tel. 0521.90.5760 - Fax. 0521.90.5758
  Home page.


Objective of the course is to provide the basic tools and understanding for the performance analysis of modern telecommunications networks.


Historical perspective on telecom networks. Mutiplexing. Switching. Multiple access. Elementary performance analysis. Little’s law. Traffic intensity. Throughput. Loss probability. Poisson process. Renewal processes. The M/G/1 queue with applications. PK formula. Vacancies. Priorities. Local area networks performance. TDMA, FDMA. Aloha. Ethernet. Token ring. Polling systems. Performance of wide area networks. Kleinrock’s formula. Optimal routing. Topology. Moore bound. Advanced performance analysis. Discrete time Markov chains. Applications. Geo/Geo/1, slotted Aloha, M/G/1, minisloted Ethernet. Absorbing chains. Continuous time Markov chains. Applications. : M/M/1, M/M/c, M/M/c/c, M/M/c/c/N. Networks of queues. Burke’s therem. Open networks and Jackson’s theorem. Jackson’s for closed networks. Sliding window flow control. Norton ‘s theorem. . Buzen’s algorithm . Mean value analysis.
For more details on lectures, please consult the Instructor’s web site.

Modalità d'esame

both written and oral


Geometria B

Testi consigliati

[1] D. P. Betsekas, R. Gallager, Data Networks, Prentice Hall.

Ultimo aggiornamento: 22-09-2008

Chiudi la finestra