Distance-vector routing protocol: Difference between revisions

Revision as of 02:50, 24 December 2019

Revision as of 09:22, 29 December 2019

Line 13:

Routers that use distance-vector protocol determine the distance between themselves and a destination. The best route for [[Internet Protocol]] [[Network packet|packets]] that carry [[data]] across a [[data network]] is measured in terms of the numbers of [[Router (computing)|routers]] (hops) a packet has to pass to reach its destination network. Additionally some distance-vector protocols take into account other traffic information, such as [[network latency]]. To establish the best route, routers regularly exchange information with neighbouring routers, usually their [[routing table]], hop count for a destination network and possibly other traffic related information. Routers that implement distance-vector protocol rely purely on the information provided to them by other routers, and do not assess the [[network topology]].<ref>{{Cite book|title= Network+ Guide to Networks|author =Tamara Dean |publisher= Cengage Learning|year=2009 |isbn= 9781423902454|pages=274}}</ref>

Distance-vector protocols update the routing tables of routers and determine the route on which a packet will be sent by the ''next hop'' which is the exit interface of the router and the IP address of the interface of the receiving router. Distance is a measure of the cost to reach a certain node. The least cost route between any two nodes is the route with minimum distance. In live applications however, certain issues become apparent. Chiefly among these is cloud access gating defined by role-based parameters within the virtualized interface. Achitectural reformatting of the interfering protocols provides a simple solution to looped routing and framework disruption in these cases, allowing for seamless access.<ref>{{cite journal |last1=Adhvaryu |first1=K |title=Efficient multicast ad hoc on-demand distance vector routing protocol |journal=Journal of Network Communications and Emerging Technologies |date=2015 |volume=5 |issue=2}}</ref>

Updates are performed periodically in a distance-vector protocol where all or part of a router's routing table is sent to all its neighbours that are configured to use the same distance-vector routing protocol. Once a router has this information it is able to amend its own routing table to reflect the changes and then inform its neighbours of the changes. This process has been described as ‘routing by rumour’ because routers are relying on the information they receive from other routers and cannot determine if the information is actually valid and true. There are a number of features which can be used to help with instability and inaccurate routing information.