Simon S. Lam
(The following guide is subject to revision. Before each exam, read the following again for the most up-to-date instructions.)
Read entire chapter 1. Note that Chapter 1 lecture slides contain materials on performance analysis not in the text. Sections 1.6 and 1.7, for you to read on your own, will not be in the exam.
Read entire chapter 2. For Section 2.7, you need to understand the basics and principles of TCP and UDP sockets as presented in class; there will not be any question on Python code in the exam. The materials on FTP (Section 2.3), BitTorrent (latter part of Section 2.6.1), and DHTs (Section 2.6.2) will not be in the exam.
Read entire chapter 3, with some exceptions:
My coverage of the material in Section 3.4 is different from your text. More specifically, I use notation and diagrams different from those used by Kurose and Ross to explain the same concepts and ideas. Also, I have performance analysis material not in the text. You should follow the notation and math in Lecture slides instead of the text.
You can skip subsection 3.6.3 on ATM congestion control.
- You can skip materials in subsections 4.3.1-4.3.5. - In subsection 4.5.1, Dijkstra's algorithm is skipped in lecture since you should have learned it in a lower-level CS class. Dijkstra's algorithm will not be in exam but you should understand Link-State broadcast. - The RIP protocol in subsection 4.6.1 and the OSPF protocol in subsection 4.6.2 will be covered at a high level with details in the protocols omitted. You need to know materials covered in lectures but not the omitted details. - You can skip section 4.7 on Broadcast and Multicast Routing. I will use several slides in class to introduce the basic concepts.
8. Security in Computer NetworksRead Chapter 8 (from page 671 through the top five lines of page 714) with the following allowances: