350-401 · Question #618
What is one difference between EIGRP and OSPF?
The correct answer is D. EIGRP uses the DUAL distance vector algorithm, and OSPF uses the Dijkstra link-state algorithm. EIGRP vs OSPF: Key Differences Why D is Correct: EIGRP (Enhanced Interior Gateway Routing Protocol) uses the DUAL (Diffusing Update Algorithm), which is a distance vector/hybrid algorithm, while OSPF (Open Shortest Path First) uses the Dijkstra (SPF) algorithm, which is a link-st
Question
What is one difference between EIGRP and OSPF?
Options
- AOSPF is a Cisco proprietary protocol, and EIGRP is an IETF open standard protocol.
- BOSPF uses the DUAL distance vector algorithm, and EIGRP uses the Dijkstra link-state algorithm
- CEIGRP uses the variance command lot unequal cost load balancing, and OSPF supports unequal
- DEIGRP uses the DUAL distance vector algorithm, and OSPF uses the Dijkstra link-state algorithm
How the community answered
(41 responses)- A2% (1)
- B2% (1)
- D95% (39)
Explanation
EIGRP vs OSPF: Key Differences
Why D is Correct: EIGRP (Enhanced Interior Gateway Routing Protocol) uses the DUAL (Diffusing Update Algorithm), which is a distance vector/hybrid algorithm, while OSPF (Open Shortest Path First) uses the Dijkstra (SPF) algorithm, which is a link-state algorithm. This is a foundational architectural difference between the two protocols.
Why the Distractors are Wrong:
- A is wrong because it has the descriptions completely backwards - EIGRP was originally Cisco proprietary (though later submitted to IETF), and OSPF is the IETF open standard
- B is wrong because it also reverses the algorithms - it incorrectly assigns DUAL to OSPF and Dijkstra to EIGRP
- C is misleading because while EIGRP does support unequal-cost load balancing via the
variancecommand, OSPF only supports equal-cost load balancing, making the second half of option C incorrect
Memory Tip: Use the acronym associations: EIGRP → DUAL (both have strong consonants, think "ED") and OSPF → Dijkstra (think "Open Shortest Path First" naturally implies running Dijkstra's shortest path algorithm).
Topics
Community Discussion
No community discussion yet for this question.