Chapter 4, Problem P5P

Consider a datagram network using 32-bit host addresses. Suppose a router has four links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as follows:

Destination Address Range	Link Interface
11100000 00000000 00000000 00000000
through	0
11100000 00111111 1111111 11111111
11100000 01000000 00000000 00000000
through	1
11100000 01000000 11111111 11111111
11100000 01000001 00000000 00000000
through	2
11100001 01111111 11111111 11111111
otherwise	3

1. a. Provide a forwarding table that has five entries, uses longest prefix matching, and forwards packets to the correct link interfaces.
2. b. Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses:

   $\begin{array}{l}\text{11}00\text{1}000\text{1}00\text{1}000\text{1}0\text{1}0\text{1}000\text{1}0\text{1}0\text{1}0\text{1}0\text{1}\hfill \\ \text{111}0000\text{1}0\text{1}000000\text{11}0000\text{11}00\text{1111}00\hfill \\ \text{111}0000\text{1}\text{1}0000000000\text{1}000\text{1}0\text{111}0\text{111}\hfill \end{array}$