Computer Networking
and Traffic Control

DSC-DO-02, 2003-04

Welcome to the graduate school lecture on Computer Networking and Traffic Control. This document is regularly updated to reflect the schedule and work assignments of the course. The purpose of the lecture is to give you a sound understanding of computer networking, with a strong emphasis on TCP/IP.

Room and Calendar

The lecture is every Wednesday 10:15-12:00 in room INR 219.
 
S1 Chapters 1 and 2: Introduction and local area networks PT
S2 Chapter 2 Local area networks (continued) PT
S3 Chapter 3: The IP protocol JL
S4 Chapter 3 The IP protocol (continued) JL
S5 Chapter 4: Congestion Control for Best Effort: Theory JL
S6 Chapter 4: Congestion Control for Best Effort: Theory (continued) JL
S7 Chapter 5: Transport layer (TCP) PT
S8 Chapter 5: Transport layer (TCP), Congestion Control in the Internet PT
S9 Chapter 6: Fairness of TCP PT
S10 Chapter 8: Application layer and TCP sockets JL
S11 Chapter 7: Routing JL
S12 Chapter 7: Routing (continued) JL
S13 Chapter 9: Quality of Service PT
S14 Chapter 9: Quality of Service (continued) PT

Homework Series

You have to complete one homework assignment per 2/3 weeks. One homework assignment is a series of exercises of various difficulty levels that have been designed to facilitate and test your understanding of the lectures. The homework assignments have to be returned approximately two weeks after you have listened to the related lectures. The precise dates are given below. Homework assignments will be collected at the end of the lectures on the day that they are due.

The final homework grade is the average of all the homework assignment. It counts for 20% of the final credit (see below). You are encouraged to discuss with your colleagues and the assistants in order to get the homework assignments done, but at the end, all of you should be able to do the exercises by yourselves.

It is a good idea to learn how to use Latex if you do not know it already.
 

Exams

Final marks are converted to the swiss academic scale, which is in the interval [1, 6], where 4 is the minimum to pass. The mapping is: P = round (0.75 + 0.05 P') where P' is the mark on 100 and P is the mark on 6; round is the function that rounds to the nearest half integer, by excess (for example, round (2.34) = 2.5 ). P >= 4 corresponds to P' > 55.

Your team

Office Hours, Exercise Sessions

Hung and Slavisa have office hours every Monday afternoon from 14:15 to 16:00 to help you with the homework series, in INF 211. If no students come until 14:30, we come back to our offices (Hung in INN 018, Slavisa in INN 032) and you can find us there until 16:00.

Support documents

Homeworks