Longest-Prefix Match Evaluation
A technician is evaluating two approaches to predict where a packet destined for the IP address 10.1.50.75 will be forwarded based on the provided routing table.
Approach X assumes the router selects the route with the lowest next-hop IP address among all matching entries. Approach Y assumes the router selects the matching route with the longest subnet mask.
| Destination Network | Prefix Length | Next Hop |
|---|---|---|
| 10.1.50.0 | /24 | 192.168.1.1 |
| 10.1.50.64 | /26 | 192.168.1.2 |
| 10.1.50.64 | /28 | 192.168.1.3 |
| 0.0.0.0 | /0 | 192.168.1.254 |
Which statement correctly evaluates these approaches?
Approach Y correctly predicts the packet will be forwarded to 192.168.1.2, because /26 is the longest prefix that encompasses 10.1.50.75.
Approach X correctly predicts the packet will be forwarded to 192.168.1.1, because routers use the lowest next-hop IP as a tie-breaker for overlapping routes.
Both approaches fail because the router will drop the packet due to overlapping subnet definitions in the routing table.
Approach Y correctly predicts the packet will be forwarded to 192.168.1.3, because longest-prefix match is the standard routing behavior.
Question Leaderboard
Not enough data yet to show leaderboard.
