Waiting for answer This question has not been answered yet. You can hire a professional tutor to get the answer.
Consider a datagram network using 16-bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding...
Consider a datagram network using 16-bit host addresses. Suppose a router uses
longest prefix matching and has the following forwarding table:
-----------------------------------------------
Prefix Match Interface
-----------------------------------------------
1 0
11 1
111 2
Otherwise 3
For each of the following 5 host addresses, give the matched interface # using above
forwarding table. (10 points)
00100000 10111111
10110000 10111111
11010000 10111111
11110000 10111111
11000000 10111111