Question: Question 3 : [ / 3 ] Consider a datagram network that uses 8 - bit host addresses. Suppose a router employs longest - prefix

Question 3:
[/3]
Consider a datagram network that uses 8-bit host addresses. Suppose a router employs longest-prefix matching and has the following forwarding table:
\table[[Prefix Match,Interface],[01,1],[11,2],[010,3],[110,4],[000,5],[otherwise,6]]
Suppose a datagram arrives at the router, with destination address 10101000. To which interface will this datagram be forwarded using longest-prefix matching?
Suppose a datagram arrives at the router, with destination address 11100111. To which interface will this datagram be forwarded using longest-prefix matching?
Suppose a datagram arrives at the router, with destination address 01011111. To which interface will this datagram be forwarded using longest-prefix matching?
Question 3 : [ / 3 ] Consider a datagram network

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!