In Problem P10 you are asked to provide a forwarding table (using longest prefix matching). Rewrite this forwarding table using the a.b.c.d/x notation instead of the binary string notation.
Take the forwarding table (using longest prefix matching) in problem 10.
Range of Destination address | Link interface |
11100000 00000000 00000000 00000000 through 11100000 00111111 11111111 1111111 | 0 |
11100000 01000000 00000000 00000000 through 11100000 01000000 11111111 11111111 | 1 |
11100000 01000001 00000000 00000000 through 11100001 01111111 11111111 11111111 | 2 |
Otherwise | 3 |
Now the following steps are used for the above forwarding table convert the a.b.c.d/x notation:
Range of Destination address | Link interface |
224.0.0.0/10 | 0 |
224.64.0.0/16 | 1 |
224.65.0.0/7 | 2 |
Otherwise | 3 |