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. Chapters 1 and 2: Introduction and local area networks S1 Chapter 2 Local area networks (continued) S2 Chapter 3: The IP protocol S3 Chapter 3 The IP protocol (continued) S4 Chapter 4: Congestion Control for Best Effort: Theory S5 Chapter 4: Congestion Control for Best Effort: Theory S6 (continued) Chapter 5: Transport layer (UDP) and sockets S7 Chapter 6: Transport layer (TCP), Congestion Control in the S8 Internet Chapter 7: Transport layer and sockets S9 Chapter 8: RED, Diffserv S10 Chapter 9: Routing S11 Chapter 9: Routing S12 Chapter 9: Routing (continued) S13 Chapter 10: MPLS, ATM S14 PT PT LT LT PT PT LT PT LT PT LT LT LT 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

The final exam is during the exam session (oral examination). Grade: max (20% homework + 80% final exam, final exam) 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

Prof. Laurent Toutain, Laurent.Toutain@enst-bretagne.fr Prof. Patrick Thiran, Patrick.Thiran@epfl.ch Dr. Chadi Barakat (homeworks) Chadi.Barakat@epfl.ch

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

Chapter 1: Introduction Chapter 2: Local Area Networks Chapter 3: The IP protocol Chapter 4: Congestion control for best effort: theory Chapter 4 (pdf) Chapter 4 (slides) Chapter 5, 7: The socket interfaces Chapter 6: Congestion control for best effort: Internet Chapter 6: TCP (slides) Chapter 8: Quality of Service in IP Networks Chapter 9: Routing Chapter 9: Routing (continued)

Homeworks

Homework 1: Introduction and Local Area Networks Solutions of Homework 1: Introduction and Local Area Networks Homework 2: IP addressing Solutions of Homework 2: IP addressing

Homework 3: Congestion control for best effort Solutions of Homework 3: Congestion control for best effort Homework 4: Sockets (Due Thursday January 17) Homework 5: Congestion control for best effort: TCP(Due Thursday February 7)