思科2.10.docVIP

1 窗体顶端 Which two routing protocols use Dijkstra’s shortest path first algorithm? (Choose two.) RIPv1 RIPv2 IS-IS BGP EIGRP OSPF 窗体底端 2 窗体顶端 What are two advantages of using a link-state routing protocol instead of a distance vector routing protocol? (Choose two.) The topology database eliminates the need for a routing table. Each router independently determines the route to each network. Link-state protocols require less router processor power than distance vector protocols. After the inital LSP flooding, they generally require less bandwidth to communicate changes in a topology. Frequent periodic updates are sent to minimize the number of incorrect routes in the topological database. 窗体底端 3 窗体顶端 What speeds up convergence in a network using link-state routing? updates triggered by network changes updates sent at regular intervals updates sent only to directly connected neighbors updates that include complete routing tables 窗体底端 4 窗体顶端 Refer to the exhibit. If all routers and interfaces are configured to use a link-state routing protocol, from which routers will router D receive hello packets? A and E B and C A, B, C, and E C only 窗体底端 5 窗体顶端 What action does a link-state router take immediately upon receipt of an LSP from a neighboring router? floods the LSP to neighbors calculates the SPF algorithm runs the Bellman-Ford algorithm computes the best path to the destination network 窗体底端 6 窗体顶端 Refer to the exhibit. What kind of information would be seen in an LSP sent from router JAX to router ATL? hop count uptime of the route cost of the link a list of all the routing protocols in use 窗体底端 7 窗体顶端 To achieve network convergence, what three steps does each link state router take? (Choose three.) use automatic summarization to reduce the size of routing tables build a Link State Packet (LSP) containing the state of each directly connected link flood the LSP to all neighbors, who then store all LSPs received in a database recalculate the