A. They establish routes that will never go down.
B. The keep routing tables small.
C. They require a great deal of CPU power.
D. The allow connectivity to remote networks that are not in the routing table.
E. They direct traffic from the Internet into corporate networks.

A. Information learned from one source is not distributed back to that source.
B. Routing updates from the poisoned source are ignored until a holddown timer expires.
C. Failed routes are advertised with infinite metrics.
D. New routing updates are ignored until the network has converged.
E. A route is marked as unavailable when its time-to-live is exceeded.

A. It routes all traffic that is addresses to the destination network to the interface indicates in the routing table.
B. It sends a copy of its neighbor table to all adjacent routers.
C. It sends a multicast query packet to all adjacent neighbors requesting available routing paths to the destination network.
D. It broadcasts Hello packets to all routers in the network to re-establish neighbor adjacencies.

A. It is logically significant.
B. It is globally significant.
C. It is needed to identify a unique instance of an OSPF database.
D. It is an optional parameter required only if multiple OSPF processes are running on the router.
E. All routers in the same OSPF area must have the same process ID if they are to exchange routing information.

A. It immediately sends its entire routing table to its neighbors.
B. EIGRP sends a Hello packet to the DR to inform it of the route failure.
C. It automatically forwards traffic to a fallback default route until a successor route is found.
D. It sends queries out to neighbors until a new successor route is found.
E. It places the route in holddown until LSA updates inform it of a new route to the network.