Computer Networking A Top Down Approach Problems from Chapter 4 of the textbook [KR]

P8 (a) Provide a forwarding table that has five entries, uses longest prefix matching,

and forwards packets to the correct link interfaces.

P8 [50+10=60 points] modified as follows. The assigned prefix for this network is 1110 000/7. Indicate the specific range of addresses reachable through interface 3. Minimize the number of entries. [Hint: Five should be enough.] Int. Destination Address Range 11100000 00000000 00000000 00000000 0 11100000 00111111 11111111 11111111 11100000 01000000 00000000 00000000 1 11100000 01000000 11111111 11111111 11100000 01000001 00000000 00000000 2 11100001 01111111 11111111 11111111 3 Otherwise (b) Indicate the appropriate link interface for each of the following destinations. 1110 0000 0000 0000 1001 0001 0101 0101 1110 0000 0100 0000 1001 0001 0101 0101 1110 0000 1000 0000 1001 0001 0101 0101 1110 0000 1100 0000 1001 0001 0101 0101 1110 0001 0000 0000 1001 0001 0101 0101 1110 0001 0100 0000 1001 0001 0101 0101 1110 0001 1000 0000 1001 0001 0101 0101 1110 0001 1100 0000 1001 0001 0101 0101