Interactive end-of-chapter exercises

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 01101000. To which interface will this datagram be forwarded using longest-prefix matching?

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

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

---

Solution

1. Since the address is 01101000, it will go to interface 2.

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

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

---

That's incorrect

That's correct

The answer was: 2

Question 1 of 3

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

Check Hint skip

The answer was: 6

Question 2 of 3

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

Check Hint skip

The answer was: 6

Question 3 of 3

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

Check Hint skip

Try Another Problem

We greatly appreciate the work of John Broderick (UMass '21) in helping to develop these interactive problems.

Copyright © 2010-2025 J.F. Kurose, K.W. Ross
Comments welcome and appreciated: kurose@cs.umass.edu