350-401 · Question #853
Drag and Drop Question Drag and drop the characteristics from the left onto the routing protocols they describe on the right. Answer:
The correct answer is It requires an Autonomous System number to create a routing instance for exchanging routing information.; It is an Advanced Distance Vector routing protocol.; It relies on the Diffused Update Algorithm to calculate the shortest path to a destination.; The default Administrative Distance is equal to 110.; It uses virtual links to connect two parts of a partitioned backbone through a non-backbone area.; It requires a process ID that is local to the router.. OSPF is characterized by an Administrative Distance of 110, uses virtual links to connect partitioned backbone areas through non-backbone areas, and requires a process ID that is locally significant to the router (not shared between routers). EIGRP is characterized by requiring a
Question
Drag and Drop Question Drag and drop the characteristics from the left onto the routing protocols they describe on the right. Answer:
Exhibit
Answer Area
Drag items
Correct arrangement
- It requires an Autonomous System number to create a routing instance for exchanging routing information.
- It is an Advanced Distance Vector routing protocol.
- It relies on the Diffused Update Algorithm to calculate the shortest path to a destination.
- The default Administrative Distance is equal to 110.
- It uses virtual links to connect two parts of a partitioned backbone through a non-backbone area.
- It requires a process ID that is local to the router.
Explanation
OSPF is characterized by an Administrative Distance of 110, uses virtual links to connect partitioned backbone areas through non-backbone areas, and requires a process ID that is locally significant to the router (not shared between routers). EIGRP is characterized by requiring an Autonomous System number to form neighbor relationships and exchange routing information, being classified as an Advanced Distance Vector (Hybrid) protocol, and using DUAL (Diffused Update Algorithm) to calculate loop-free shortest paths to destinations.
Topics
Community Discussion
No community discussion yet for this question.
