Podcast
Questions and Answers
Dynamic routing protocols operate by manually configuring routing tables for each router.
Dynamic routing protocols operate by manually configuring routing tables for each router.
False (B)
OSPF is a protocol that allows routers to dynamically learn about networks connected to them.
OSPF is a protocol that allows routers to dynamically learn about networks connected to them.
True (A)
Static routes are indicated by the status code 'O' in the routing table.
Static routes are indicated by the status code 'O' in the routing table.
False (B)
The link-local address is used by IPv4 routing protocols to identify the next-hop router.
The link-local address is used by IPv4 routing protocols to identify the next-hop router.
The routing entries for both IPv4 and IPv6 networks include information about the next-hop router's address.
The routing entries for both IPv4 and IPv6 networks include information about the next-hop router's address.
The structure of an IPv6 routing table was influenced by the concept of classful addressing.
The structure of an IPv6 routing table was influenced by the concept of classful addressing.
An IPv6 route entry formatted as 'C 2001:DB8:ACAD:1::/64 [0/0]' indicates a directly connected network.
An IPv6 route entry formatted as 'C 2001:DB8:ACAD:1::/64 [0/0]' indicates a directly connected network.
The subnet mask for the route 192.168.12.0/30 uses a 30-bit mask.
The subnet mask for the route 192.168.12.0/30 uses a 30-bit mask.
The route entry 'R1# show ipv6 route' is an indication of the routing protocol being used.
The route entry 'R1# show ipv6 route' is an indication of the routing protocol being used.
Static routing is exclusively used in larger networks with multiple paths.
Static routing is exclusively used in larger networks with multiple paths.
IPv6 routing tables are not formatted uniformly.
IPv6 routing tables are not formatted uniformly.
The administrative distance for directly connected routes is 0.
The administrative distance for directly connected routes is 0.
In OSPF, faster links are assigned higher costs compared to slower links.
In OSPF, faster links are assigned higher costs compared to slower links.
EIGRP summary routes have an administrative distance of 20.
EIGRP summary routes have an administrative distance of 20.
The next-hop address for an IPv6 route entry can be identified by the notation 'via FE80::2:C'.
The next-hop address for an IPv6 route entry can be identified by the notation 'via FE80::2:C'.
EIGRP calculates a metric based solely on bandwidth.
EIGRP calculates a metric based solely on bandwidth.
RIP has a higher administrative distance than OSPF.
RIP has a higher administrative distance than OSPF.
The entry 'OE2 ::/0 [110/1], tag 2' signifies a static route in IPv6.
The entry 'OE2 ::/0 [110/1], tag 2' signifies a static route in IPv6.
Static routing can be used to explicitly define the path for a specific network.
Static routing can be used to explicitly define the path for a specific network.
Equal cost load balancing allows a router to use multiple paths to send packets equally when paths have the same cost.
Equal cost load balancing allows a router to use multiple paths to send packets equally when paths have the same cost.
A parent route may include several child routes with similar attributes.
A parent route may include several child routes with similar attributes.
Static routes cannot be used for load balancing in a network.
Static routes cannot be used for load balancing in a network.
External BGP has an administrative distance of 200.
External BGP has an administrative distance of 200.
Dynamic routing protocols and static routes are mutually exclusive and cannot be used together.
Dynamic routing protocols and static routes are mutually exclusive and cannot be used together.
Dynamic routing protocols automatically implement unequal cost load balancing.
Dynamic routing protocols automatically implement unequal cost load balancing.
OSPF has a higher administrative distance than IS-IS.
OSPF has a higher administrative distance than IS-IS.
The longest match in a routing table is defined as the route with the least number of matching bits.
The longest match in a routing table is defined as the route with the least number of matching bits.
Directly connected networks are those that appear in the routing table due to active interfaces of the router.
Directly connected networks are those that appear in the routing table due to active interfaces of the router.
Static routes can be useful for routing between stub networks.
Static routes can be useful for routing between stub networks.
Load balancing can increase the effectiveness and performance of a network.
Load balancing can increase the effectiveness and performance of a network.
The administrative distance for an internal EIGRP route is 90.
The administrative distance for an internal EIGRP route is 90.
The metric used by OSPF is based only on cumulative distance.
The metric used by OSPF is based only on cumulative distance.
A routing table can contain multiple exit interfaces for the same destination.
A routing table can contain multiple exit interfaces for the same destination.
The best path in the routing table is defined as the shortest match.
The best path in the routing table is defined as the shortest match.
For a route to match the destination IP address, a certain number of far-left bits must match.
For a route to match the destination IP address, a certain number of far-left bits must match.
The longest match is always the preferred route in the routing table.
The longest match is always the preferred route in the routing table.
In the example given, the destination IPv4 address is 172.16.0.0/26.
In the example given, the destination IPv4 address is 172.16.0.0/26.
An IPv4 packet with the address 172.16.0.10 matches three routes in the routing table.
An IPv4 packet with the address 172.16.0.10 matches three routes in the routing table.
The prefix length indicates how many bits must match for a route to be considered valid.
The prefix length indicates how many bits must match for a route to be considered valid.
The router would select the route 172.16.0.0/12 to forward the packet based on the longest match rule.
The router would select the route 172.16.0.0/12 to forward the packet based on the longest match rule.
IPv6 addresses also utilize the concept of prefix length for routing.
IPv6 addresses also utilize the concept of prefix length for routing.
The address 2001:db8:c000::99 is an example of an IPv4 address.
The address 2001:db8:c000::99 is an example of an IPv4 address.
Matching bits are used to determine the best path in a routing table.
Matching bits are used to determine the best path in a routing table.
Flashcards are hidden until you start studying
Study Notes
Routing Table Overview
- Interface entries in a routing table are marked with specific codes indicating route types (e.g., O for OSPF, C for connected).
- Example routes include:
- O 192.168.3.0/24 [110/65] - OSPF learned route
- C 192.168.12.0/30 - Directly connected route
- L 192.168.12.1/32 - Local route
IPv6 Routing Table Structure
- IPv6 routing does not incorporate classful addressing; entries are formatted uniformly.
- An example entry: OE2 ::/0 [110/1], tagged as an external route with specific next-hop details.
- Directly connected entries indicated as 'C' along with local addresses marked 'L'.
Administrative Distance (AD)
- Different routing protocols have specific administrative distances:
- Directly connected: 0
- Static route: 1
- EIGRP summary: 5
- External BGP: 20
- Internal EIGRP: 90
- OSPF: 110
- IS-IS: 115
- RIP: 120
- External EIGRP: 170
- Internal BGP: 200
Static and Dynamic Routing
- Networks utilize a combination of static routes and dynamic routing protocols.
- Static routes commonly serve as:
- Default route to a service provider
- Routes outside the routing domain
- Explicit path definitions by administrators
- Routing for stub networks
Load Balancing
- Equal cost load balancing occurs when multiple paths to a destination have the same metric.
- Routers will utilize all available paths equally to enhance efficiency and performance.
- Dynamic routing protocols support equal cost load balancing; static routes need multiple entries to enable it.
Path Determination and Longest Match
- The best path for forwarding packets is determined by the longest match principle.
- Longest match occurs when the route has the greatest number of matching bits with the destination IP.
- For example, in an IPv4 routing table, 172.16.0.0/26 is preferred over 172.16.0.0/12 and 172.16.0.0/18 for the destination 172.16.0.10.
Static Routes Example
- Static routes can be visualized in a topology where IPv4 and IPv6 routes are configured to reach specific networks.
- Configured static routes provide explicit directions to the routers.
Dynamic Routing Protocols
- Dynamic routing protocols enable automated sharing of network reachability and status.
- They support activities like network discovery and routing table maintenance.
- OSPF example entries indicate learned routes with proper next-hop addresses for route forwarding.
Studying That Suits You
Use AI to generate personalized quizzes and flashcards to suit your learning preferences.