Content deleted Content added
m In the introduction, in the second sentence of the first paragraph, changed the comma after "has to pass" to a semicolon. |
m In the introduction, fourth sentence of first paragraph, changed "routers, on which a distance-vector protocol is implemented," to "routers using a distance-vector protocol". Also, in the same paragraph, last sentence, changed "informs" to "inform". |
||
Line 5:
}}
A '''distance-vector routing protocol''' in [[data networks]] determines the best route for data packets based on distance. Distance-vector routing protocols measure the distance by the number of [[Router (computing)|routers]] a packet has to pass; one router counts as one hop. Some distance-vector protocols also take into account [[network latency]] and other factors that influence traffic on a given route. To determine the best route across a network, routers
Distance-vector routing protocols use the [[Bellman–Ford algorithm]] to calculate the best route. Another way of calculating the best route across a network is based on link cost, and is implemented through [[link-state routing protocol]]s.
| |||