Comp 343/443-001 Week 5 notes

September 26

Assignment 2   

    Chapter 7: exercises 2.0, 6.0 (packet travel times)
    Chapter 8: exercises 7.0, 8.0 (sliding windows)
    Chapter 9: exercises 6.0, 8.0 (IPv4)
    Chapter 13: exercises 2.0, 4.0 (routing)

Due Oct 11 (fall break Wednesday)



8. Sliding windows, intronetworks.cs.luc.edu/current2/html/slidingwindows.html

    single-sender bottleneck examples

    formulas

Chapters 9 & 10: IPv4

IPv4 header
Fragmentation
Classless Routing
Subnets
NAT
DNS
ARP
DHCP
ICMP

Facebook outage of 2021

Chapter 13: Routing

    Basics of distance-vector routing
    Slow convergence


Subnet example:

We get to our site using the first three bytes of the /24 IPv4 address. Now we want to route to A, B, C or D using only a prefix of the fourth byte. The use of prefixes means that each subnet size will be a power of 2. (Could we, in theory or in practice, divide into ranges by numeric intervals, [1..70], [71..110], [111-135], [136..155]? How would you then handle overlaps?)

Step one: round up to powers of 2

Step 2: figure out how many prefix bits (subnet bits) we have for each: 1 for A, 2 for B, 3 for C and D

Step 3: Start filling them in!

A:    ____

B:    ____   ____

C:    ____   ____   ____

D:    ____   ____   ____