Where and when?

Lectures: Tuesday and Thursday 1:10-2:25pm
Room: 203 Mathematics

Office hours:
Monday 11-11:30am (L. Yan, CEPSR 6LW5)
Monday 5:5-30pm (Z. Cao, CEPSR 6LW5)
Tuesday 2:30-3:15pm (A. Chaintreau, CEPSR 610)
Wednesday 5:5-30pm (Z. Cao, CEPSR 6LW5)
Thursday 11-11:30am (L. Yan, CEPSR 6LW5)
Thursday 2:30-3:15pm (A. Chaintreau, CEPSR 610)
Friday 4-5:15pm (S. Balasubramanian, CEPSR 6LW5)
NB: all 30mn office hours can be extended by 15mn depending on demand, but you need to come during this time, for planning.

Who is teaching?

Augustin Chaintreau (instructor), TBA (Teaching Assistants)

Prerequisite?

This class contains 2 programming assignments so you should be comfortable writing programs in C and/or Java.
This class contains analysis of performance of network protocols. You need to know discrete probability at an introductory level.

Grading scheme:

The evaluation will be based on:
  • 2 programming assignments (30%, 15% each)
  • 5 written assignments (20%, 4% each)
  • a mid-term exam (15%)
  • a final exam (35%)
  • class participation (no % but you'll get an apple!)
Please read the Rules applying to homework submissions.


Reading, Textbook:

We will follow Chapter 1 to 5 of "Computer Networking: a top-down approach" by James F. Kurose and Keith W. Ross (ISBN and details below)
978-0-13-285620-1
Computer networking :a top-down approach (6th ed.)
James F. Kurose, Keith W. Ross.
Boston :Addison-Wesley,
2010.
It is recommended to read the associated chapter before the lecture.
The page that we will cover are indicated on the Detailed Contents page.
There are occasionally content covered outside the book, they will be indicated and referenced in the "Detailed Content" page.