Interactive Problems, Computer Networking: A Top Down Approach

Longest Prefix Matching

Consider a datagram network using 8-bit host addresses.
Suppose a router uses longest-prefix matching, and has the following forwarding table:

Question List

1. Suppose a datagram arrives at the router, with destination address 10001110. To which interface will this datagram be forwarded using longest-prefix matching?

2. Suppose a datagram arrives at the router, with destination address 00010010. To which interface will this datagram be forwarded using longest-prefix matching?

3. Suppose a datagram arrives at the router, with destination address 01100101. To which interface will this datagram be forwarded using longest-prefix matching?

Solution

1. Since the address is 10001110, it will go to interface 6.

2. Since the address is 00010010, it will go to interface 6.

3. Since the address is 01100101, it will go to interface 3.

That's incorrect

That's correct

The answer was: 6

Question 1 of 3

Suppose a datagram arrives at the router, with destination address 10001110. To which interface will this datagram be forwarded using longest-prefix matching?

The answer was: 6

Question 2 of 3

Suppose a datagram arrives at the router, with destination address 00010010. To which interface will this datagram be forwarded using longest-prefix matching?

The answer was: 3

Question 3 of 3

Suppose a datagram arrives at the router, with destination address 01100101. To which interface will this datagram be forwarded using longest-prefix matching?

Try Another Problem