Bellman-Ford — CompTIA Network+ (N10-009) Practice Questions

The Bellman-Ford algorithm is a path-finding algorithm used by certain routing protocols to calculate the shortest path to every destination in a network by iteratively relaxing edge weights. On the Network+ exam, Bellman-Ford is significant primarily because it is the basis for distance-vector routing protocols, most notably RIP, and it is capable of handling negative-weight links, unlike Dijkstra's algorithm. Candidates should understand that Bellman-Ford operates by having each router share its entire routing table with directly connected neighbors, which contributes to slower convergence and susceptibility to routing loops if not addressed by mechanisms such as split horizon or poison reverse. This theoretical foundation helps explain the behavior and limitations of distance-vector protocols tested in the routing domain.

Free questions on bellman-ford

More bellman-ford questions in the full bank

• Which routing protocol uses the Bellman-Ford algorithm and has a maximum hop count of 15? Unlock answer & explanation →