Network Layer CS176A Ramya Raghavendra
Routing table [Q1] Destination Address Range Link Interface Through Through Through Otherwise 3
Subnetting [Q2] A B C D E F
Subnetting / N bits – 2 n addresses : 8 bits – 256 etc Each router: subnet (A,B or C) + 2 of (D, E, F) Longest Prefix matching (Examples) – : A – : D
NAT Translation Table [Q3] NAT translation table WAN sideLAN side , , , , , , , ,4001
Dijkstra’s Algorithm Have some fun:
Link State Routing [Q6] u 5 6
Reverse Path Forwarding [Q7] Controlled flooding Router receives a broadcast packet Checks if the packet came on the “shortest unicast link” to the source –Path used to send a unicast packet to source If so, forwards it on all other links Else discards it
Illustration of RPF
Questions on Extra Credit? - Is it easy? Yes me!