Computer Networking
and Traffic Control

DSC-DO-02, 2001-2002
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 Thursday 14:15-16: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 LT
S4 Chapter 3 The IP protocol (continued) LT
S5 Chapter 4: Congestion Control for Best Effort: Theory PT
S6 Chapter 4: Congestion Control for Best Effort: Theory (continued) PT
S7 Chapter 5: Transport layer (UDP) and sockets LT
S8 Chapter 6: Transport layer (TCP), Congestion Control in the Internet PT
S9 Chapter 7: Transport layer and sockets LT
S10 Chapter 8: RED, Diffserv PT
S11 Chapter 9: Routing LT
S12 Chapter 9: Routing LT
S13 Chapter 9: Routing (continued) LT
S14 Chapter 10: MPLS, ATM PT

Homework Series

You have to complete one homework assignment per 2 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 two weeks later to Chadi Barakat, at the latest at the beginning of the lecture. They are corrected and graded. Homework Hi can be done with the material seen up to lecture on week Wi; it is due on week i+2.

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.

Do not waste time using Latex, unless your handwriting justifies it.
 

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 and Newsgroup

Chadi has office hours every Monday afternoon from 14:15 to 16:00 to help you with the homework series, room INR219. There may also be exercise sessions organized as the need arises.

Support documents

Homeworks