Routers using distance vector protocol do not have knowledge of the entire path to a destination. The term distance vector refers to the fact that the protocol manipulates vectors (arrays) of distances to other nodes in the network. Compared to link-state protocols, which require a router to inform all the nodes in a network of topology changes, distance-vector routing protocols have less computational complexity and message overhead. Distance-vector routing protocols use the Bellman-Ford algorithm, Ford–Fulkerson algorithm, or DUAL FSM (in the case of Cisco Systems's protocols) to calculate paths.Ī distance-vector routing protocol requires that a router informs its neighbors of topology changes periodically. In computer communication theory relating to packet-switched networks, a distance-vector routing protocol is one of the two major classes of routing protocols, the other major class being the link-state protocol.
0 kommentar(er)
