Comp 343/443-001 Week 2 notes

Introduction to the textbook
Programming assignments

Assignment 1
    Chapter 1 exercises 1.0, 4.0, 5.0, 7.0, 9.0, 10.0, 11.0
    Chapter 2 exercises 2.0, 3.0, 7.0
    Due Friday, Sept 15

Review basic Ethernet-switch learning algorithm

    Note that switches learn destinations by "eavesdropping". They can do this because they always have the option to "fall back to flooding".

Talk about homework 1

IP layer: from 1.10

Class A/B/C addressing system
administratively assigned
no flooding option!
network prefix v host portion; what this means for scalability
IP version of datagram forwarding
hierarchical routing
backbone

best-effort
why does IP support fragmentation?
connectionless
    virtual circuits

IP routing
    next_hop
    local delivery

IP addressing

1.11: DNS

1.12: Transport
    TCP goals
    TCP interface

1.13: Firewalls

Quick look at Chapter 9: