Topic 7B: Compare and Contrast Dynamic Routing Concepts Flashcards

1
Q

Why is dynamic routing required?

A

Complex networks need to exchange routing information rapidly to prevent outages, making static routing updates impractical in most cases.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What do advanced addressing schemes accomplish?

A

They maximize utilization of scarce IPv4 address space.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Define dynamic routing.

A

A routing table entry, learned from another router via a dynamic routing protocol.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What does a dynamic routing protocol do?

A

Uses an algorithm and metrics to build and maintain a routing information database.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is stored in a routing information database?

A

Information about the networks to which the router is connected, and where there are multiple paths, it prioritizes one over the rest.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Who can share a router’s information?

A

The router’s neighbors.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is a learned route?

A

A route that was communicated to a router by another router.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What can a router do with learned routes?

A

Add learned routes from one or more routing protocols to its IP routing table.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

The algorithms used for path selection can be categorized according to what?

A

Topology and metrics that they use to build and update a routing information base and prioritize optimal (or least-cost) paths.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What are most algorithms classed as?

A

Either distance vector or as link state.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Define the distance vector algorithm.

A

Selects a forwarding path based on the next hop router with the lowest hop count to the destination network.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Define the link state algorithm.

A

Builds a complete network topology to use to select optimum forwarding paths.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What do some protocols use to perform path selection more efficiently.

A

A hybrid of different methods.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

How many routing information bases of routes does a router maintain?

A

For each protocol that it runs, the router maintains a routing information base of routes discovered by that protocol.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Are these databases integrated with the IP routing table used to determine the forwarding path?

A

These databases are separate.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q
A