How can EIGRP topologies be designed to converge as fast as possible in the event of a point-to-point link failure?
Build neighbor adjacencies in a triangulated fashion
Build neighbor adjacencies in a squared fashion
Limit the query domain by use of distribute lists
Limit the query domain b use of summarization
Limit the query domain by use of default routes
Submit