Distance Vector Routing | Computer Networks | Distance vector routing algorithm

Показать описание

The distance vector routing - Intra domain routing algorithm in computer network has been studied with example.

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 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 neighbors of network topology changes periodically.

The Distance vector algorithm is iterative, asynchronous and distributed.
** It is distributed in that each node receives information from one or more of its directly attached neighbors, performs calculation and then distributes the result back to its neighbors.
**It is iterative in that its process continues until no more information is available to be exchanged between neighbors.
** It does not require that all of its nodes operate in the lock step with each other.
**The Distance vector algorithm is a dynamic algorithm.
**It is mainly used in ARPANET, and RIP.
**Each router maintains a distance table known as Vector.

SUGGESTED:

🖥️Computer Networks playlist:

Control System playlist:

Analog and Digital Communication:

PSPICE Tutorial:(Analog and Digital Electronics Lab)

🌎Online utility playlist:

Google forms Add-on Tutorial:

🔔SUBSCRIBE to channel for more videos:

#computernetworks
#distancevectorrouting
#bellmanfordalgorithm