COMMUNICATION NETWORKS B
cod. 16625

Academic year 2008/09
2° year of course - First semester
Professor
Academic discipline
Telecomunicazioni (ING-INF/03)
Field
A scelta dello studente
Type of training activity
Student's choice
45 hours
of face-to-face activities
5 credits
hub:
course unit
in - - -

Learning objectives

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

Prerequisites

<br />Geometria B

Course unit content

<br />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. <br />For more details on lectures, please consult the Instructor’s web site: www.tlc.unipr.it/bononi/teach.html<br />

Full programme

- - -

Bibliography

D. P. Betsekas, R. Gallager, Data Networks, Prentice Hall.

Teaching methods

<br />The final exam consists of a two-hour written test (open book), followed by an oral examination.

Assessment methods and criteria

- - -

Other information

- - -