Question: 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
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 11100000 00011111 11111111 11111111
| 0 |
| 11100000 00100000 00000000 00000000 through 11100000 00100000 11111111 11111111
| 1 |
| 11100000 00110001 00000000 00000000 through 11100000 00111111 11111111 11111111 | 2 |
| Otherwise | 3 |
a) Provide a forwarding table that has five entries, uses longest prefix matching, and forwards packets to the correct link interfaces.
(Hint: your forwarding table will be in the following format)

b) Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses:
i. 11001000 10010001 01010001 01010101
ii. 11100001 00100000 00010001 01110111
Prefix Match 11001000 00010111 00010 11001000 00010111 00011000 11001000 00010111 00011 otherwise Link Interface
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
