Routing Tables, Route Preference, and Longest Prefix Matches
Routing Tables, Route Preference, and Longest Prefix Matches
|
|
|
|
|
This module defines the difference between directly connected, static, and dynamic routes, and it describes how route preference selects the best route to a destination. It explains the process of longest prefix match lookups and demonstrates how to view and verify the inet.0 and inet6.0 routing tables.
Lab 6: Routes and Routing Tables
|
Full Course Price: $4,000 USD
Purchase Includes: 365 Days of Access
Difficulty Level: Foundational
|