Question: 2. Longest prefix matching. Consider a datagram network using 32-bit host addresses. Suppose that a router has three interfaces, numbered O through 2, and that

2. Longest prefix matching. Consider a datagram network using 32-bit host addresses. Suppose that a router has three interfaces, numbered O through 2, and that packets are to be forwarded to these link interfaces as follows. Any address not within the ranges in the table below should not be forwarded to an outgoing link interface. Create a forwarding table using longest prefix matching. Destination address range Outgoing link interface 0000000 00000000 00000O00 00000000 01010101 00000000 00000000 00000000 rO 01010110 00000000 00000000 00000000 throug
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
