Distance-Vector — CompTIA Network+ (N10-009) Practice Questions
Distance-vector routing protocols determine the best path to a destination based on hop count or another metric, with each router sharing its routing table only with directly connected neighbors. The Network+ exam covers RIP as the primary example of a distance-vector protocol, including its metric (hop count with a maximum of 15), update interval, and limitations such as slow convergence and susceptibility to routing loops. Candidates must understand loop-prevention mechanisms including split horizon, route poisoning, and holddown timers, as these are common exam topics. Comparing distance-vector behavior to link-state and hybrid protocols such as OSPF and EIGRP is also tested, reinforcing when each protocol type is appropriate.
Free questions on distance-vector
Which routing protocol uses the Bellman-Ford algorithm and is best suited for small networks?
Free question · easy · full answer + explanation
More distance-vector questions in the full bank
- Which routing protocol uses hop count as its primary metric for determining the best path? Unlock answer & explanation →