TELECOMMUNICATION NETWORKS
Anno accademico 2016/2017 - 1° annoCrediti: 9
SSD: ING-INF/03 - Telecomunicazioni
Organizzazione didattica: 225 ore d'impegno totale, 176 di studio individuale, 49 di lezione frontale
Semestre: 2°
ENGLISH VERSION
Obiettivi formativi
Knowledge of the fundamentals of the network protocols and architectures.
Knowledge of the fundamentals of network performance analysis.
Prerequisiti richiesti
Basic knowledge of the general principles of electrical, electronic, and computing engineering, with specific reference to fundamentals of communications.
Frequenza lezioni
Tuesday, 9:00-11:00 (P5)
Wednesday, 11:00-13:00 (P5)
Thursday, 11:00-14:00 (P7)
Contenuti del corso
1. Introduction to networking
Historical evolution of networks and telematic systems. Communication protocols and services. Layered architectures. ISO/OSI Reference Model. TCP/IP architecture. Taxonomy of telecommunication networks. Multiplexing techniques. Circuit and packet switching.
2. Data transmission
Encoding and framing techniques. Error control. Retransmission schemes. Sliding window flow control. Examples of data-link protocols.
3. Multiple access networks
Classification of Medium Access Control (MAC) protocols. Random access schemes: ALOHA, Slotted-Aloha. Carrier Sensing Schemes: CSMA, CSMA-CD, CSMA-CA. Token passing schemes. Ethernet. Protocols for wireless local and personal area networks: IEEE 802.11, Bluetooth, IEEE 802.15.
4. Routing and mobility
Taxonomy of routing techniques. Routing algorithms: shortest-path routing, distance vector routing, link state routing. Mobility management issues.
5. Network performance aspects and queueing theory
Network performance metrics. Introduction to queueing theory. Poisson processes. Discrete-time Markov chains. Continuous-time Markov chains. M/M/1 systems. M/M/1/n systems. M/G/1 systems. M/G/1 systems with priority. M/D/1 systems. Introduction to networks of queues. Queueing theory in practice: traffic descriptors, delay and rate guarantees.
6. Congestion control and resource allocation
Classification of resource allocation and congestion control techniques. Queueing management policies. Scheduling strategies. Quality of Service.
7. Security
Classification of network attacks. Principles of cryptography. Securing techniques. Authentication schemes.
Testi di riferimento
- A. Tanenbaum: Computer Networks, Prentice-Hall.
- J. Kurose, K. Ross: Computer Networking, Addison-Wesley.
- D. Bertsekas, R. Gallager: Data Networks, Prentice-Hall.
Programmazione del corso
| * | Argomenti | Riferimenti testi | |
|---|---|---|---|
| 1 | Historical evolution of networks and telematic systems. | Kurose, Ross: Ch. 1.7 | |
| 2 | * | Communication protocols and services. | Tanenbaum: Ch. 1.3 |
| 3 | * | Layered architectures. ISO/OSI Reference Model. TCP/IP architecture. | Tanenbaum: Ch. 1.4 |
| 4 | Taxonomy of telecommunication networks. | Tanenbaum: Ch. 1.2, 1.5 | |
| 5 | * | Multiplexing techniques. | Tanenbaum: Ch. 2.5 |
| 6 | * | Circuit and packet switching. | Tanenbaum: Ch. 5.1 |
| 7 | * | Encoding and framing techniques. Error control. Retransmission schemes. | Tanenbaum: Ch. 3.1, 3.2 |
| 8 | * | Sliding window flow control. | Tanenbaum: Ch. 3.3, 3.4 |
| 9 | Examples of data-link protocols. | Tanenbaum: Ch. 3.5 | |
| 10 | Classification of Medium Access Control (MAC) protocols. | Tanenbaum: Ch. 4.1 | |
| 11 | * | Random access schemes: ALOHA, Slotted-Aloha. | Tanenbaum: Ch. 4.2.1 |
| 12 | * | Carrier Sensing Schemes: CSMA, CSMA-CD, CSMA-CA. | Tanenbaum: Ch. 4.2.2, 4.2.5 |
| 13 | Token passing schemes. | Tanenbaum: Ch. 4.2.3 | |
| 14 | * | Ethernet. | Tanenbaum: Ch. 4.3 |
| 15 | * | Protocols for wireless local and personal area networks: IEEE 802.11. | Tanenbaum: Ch. 4.4 |
| 16 | Bluetooth, IEEE 802.15 | Tanenbaum: Ch. 4.6 | |
| 17 | * | Taxonomy of routing techniques. Routing algorithms: shortest-path routing, distance vector routing, link state routing. Mobility management issues. | Tanenbaum: Ch. 5.2 |
| 18 | Network performance metrics. Introduction to queueing theory. | Bertsekas, Gallager: Ch. 3.1, 3.2 | |
| 19 | Poisson processes. Discrete-time Markov chains. Continuous-time Markov chains. | Bertsekas, Gallager: Ch. 3 Appendix A | |
| 20 | M/M/1 systems. M/M/1/n systems. M/G/1 systems. M/G/1 systems with priority. M/D/1 systems. Introduction to networks of queues. | Bertsekas, Gallager: Ch. 3.3, 3.4, 3.5, 3.8 | |
| 21 | Queueing theory in practice: traffic descriptors, delay and rate guarantees. | Tanenbaum: Ch. 6.6.1, 6.6.2 | |
| 22 | * | Classification of resource allocation and congestion control techniques. Queueing management policies. Scheduling strategies. Quality of Service. | Tanenbaum: Ch. 5.3, 5.4 |
| 23 | Classification of network attacks. Principles of cryptography. | Tanenbaum: Ch. 8.1 | |
| 24 | Securing techniques. Authentication schemes. | Tanenbaum: Ch. 8.6, 8.7 |
N.B. La conoscenza degli argomenti contrassegnati con l'asterisco è condizione necessaria ma non sufficiente per il superamento dell'esame. Rispondere in maniera sufficiente o anche più che sufficiente alle domande su tali argomenti non assicura, pertanto, il superamento dell'esame.
Verifica dell'apprendimento
Modalità di verifica dell'apprendimento
Oral discussion (prova orale)