Dynamic Routing II: EIGRP and Introduction to OSPF

Which algorithm does EIGRP use to compute loop-free paths?

What are EIGRP's internal and external administrative distances?

Which three tables does EIGRP maintain?

What is EIGRP's feasibility condition?

With default K values, which inputs does the EIGRP metric actually use?

Which EIGRP feature enables unequal-cost load balancing?

What is OSPF's administrative distance and IP protocol number?

In OSPF area design, which area is the mandatory backbone?

Which OSPF LSA type is generated by the ABR and carries inter-area routes?

How is the OSPF DR elected?

A feasible successor is installed in the routing table alongside the successor.

EIGRP sends Query messages to neighbours when no feasible successor is available.

EIGRP enables rapid convergence without counting to infinity.

EIGRP is classful and does not support VLSM.

OSPF must recalculate SPF on every topology change.

OSPF supports unequal-cost load balancing.

An OSPF area may connect directly to another non-backbone area without passing through Area 0.

An OSPF router with a priority of 0 is ineligible to become DR or BDR.

The purpose of the DR is to reduce LSA flooding on multi-access networks.

EIGRP's stub routing feature limits the scope of queries in hub-and-spoke WAN designs.

Match each protocol with its classification.

Match each protocol with its administrative distance.

Match each EIGRP term with its meaning.

Match each OSPF LSA type with the router that generates it.

Match each EIGRP advantage over OSPF with its reason.