Distance-vector routing protocol: Difference between revisions

Content deleted Content added
No edit summary
No edit summary
Line 4:
}}
 
This protocol is introduced by NITESHMallu GOUDSravan Kumar(Unni)
 
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, on which a distance-vector protocol is implemented, exchange information with one another, usually [[routing tables]] plus hop counts for destination networks and possibly other traffic information. Distance-vector routing protocols also require that a router informs its neighbours of [[network topology]] changes periodically.