Theoretical Classes

Class 1 - ??h, September ?? , room ???

Syllabus presentation.

Network Layer Design Issues - Services and Internal Organization.
Routing algorithms: The optimality principle.
 

Bibliography:

- "Computer Networks", 6ª Ed., A.S. Tanenbaum & N. Feamster & D.Wetherall, 6ª ed, Pearson Ed. Limited, 2021, pp. 359-369; sec. 5.1, 5.2.1.

- RIT1 presentation slides (in Portuguese)
- Presentation slides (in Portuguese)

Class 2 (EXTRA) - ??h or ??h, September ??, room 3.3 Ed. X

Routing Algorithms: Shortest Path (Dijkstra Algorithm); Flooding; Distance Vector Routing: algorithm description, counting to infinity problem, the "split horizon with poisoned reverse" and "hold down" solutions; Link state routing.

Bibliography:

- "Computer Networks", 6ª Ed., A.S. Tanenbaum & N. Feamster & D.Wetherall, 6ª ed, Pearson Ed. Limited, 2021, pp. 370-382; sec. 5.2.2-5.2.5.

- "Routing Loop Prevention"
- Presentation slides (in Portuguese)

Class 3 - ??h, September ??, room 113 Ed. IV

Routing algorithms: Hierarchical routing; Broadcast routing; Multicast routing; Anycast routing.

The need for Traffic Management: Congestion.

Bibliography:

- "Computer Networks", 6ª Ed., A.S. Tanenbaum & N. Feamster & D.Wetherall, 6ª ed, Pearson Ed. Limited, 2021, pp. 382-393; sec. 5.2.6-5.3.1.

- Presentation slides (in Portuguese)