Question: ( 1 0 points ) Consider a datagram network using 1 6 - bit host addresses. Suppose a router uses longest prefix matching and has

(10 points) Consider a datagram network using 16-bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding table:
\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 the above forwarding table.
1010000010111111
1111000010111111
1101000010111111
0111000010111111
1100000010111111
( 1 0 points ) Consider a datagram network using

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!