Ch. 6 - IP Routing Essentials Flashcards
1
Q
What is a distance vector algorithm?
A
Advertises routes as vectors, selects path based on distance (metric/cost to reach a network)
2
Q
What is an example of an enhanced DV algorithm?
A
EIGRP
3
Q
What does EIGRP offer in terms of convergence (when the network topology changes)?
A
Rapid convergence
4
Q
When does EIGRP send updates to routing tables?
A
Only when there is a change in the network
5
Q
What is one characteristic of EIGRP that is like a link-state protocol?
A
EIGRP uses hello packets and forms neighbor-neighbor relationships
6
Q
Besides hop count, what does EIGRP use for path calculations?
A
Bandwidth, delay, reliability, load, and MTU size
7
Q
A
