Question: Example Problem Consider a network using 8-bit addresses. Suppose a router uses longest prefix matching with the following forwarding table. Prefix Nexthop I0 100

Example Problem " Consider a network using 8-bit addresses. Suppose a router uses longest prefix matching with the following forwarding table. Prefix Nexthop I0 100 R I R2 0100 R3 R4 Default R5 Where will the router send packets with the following destinations? 0100 1011 i) 0101 1100 i) 1100 101 I iv) 1000 0010 v) 101O 1110 For each of the five next hops, give the associated range of destination host addresses and the number of addresses in the range
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
