[Back to Lecture Notes page]

The Network Layer - Readings

Computer Networks (3rd Ed), A. Tanenbaum, Chapter 5

• Required:
  • Section 5.1 - all
  • Section 5.2 - all except
    • sections titled "The Count-to-Infinity Problem" (pg 357), and the "Split Horizon Hack" (pg 358)
    • 5.2.9, and 5.2.10 - I have a bit on it in the lecture notes, but they will not be examinable.
  • Section 5.3 - all except
    • final 5 paragraphs in section titled "The Leaky Bucket Algorithm" (pg 380) and Figure 5-25.
    • final 6 paragraphs in section titled "The Token Bucket Algorithm" (pg 381) on the calculating burst rates
    • 5.3.4
    • The formula in 5.3.6
    • sections titled "The Weight fair Queueing" (pg 388), and the "The Hop-by-Hop Choke Packets" (pg 389)
    • 5.3.9
  • Section 5.4 - all except 5.4.6
  • Section 5.5 - all except 5.5.5, 5.5.6, 5.5.7, 5.5.8 and 5.5.9
  • Section 5.7
• Optional (not required for exam)
  • Sec 5.2.9
  • Sec 5.2.10
  • Sec 5.3.9
  • Sec 5.4.6
  • Sec 5.5.5
  • Sec 5.5.7

[Back to Lecture Notes page]