EC8563– Implementation of Distance Vector roting.ppsx

Networks

1. EC8563–Communication
Networks Laboratory
9. Implementation of Distance Vector
Routing algorithm

2. Distance Vector Routing Algorithm
•Also Known as Bellman-Ford Algorithm
•Each router maintains a Distance Vector table
containing the distance between itself and ALL
possible destination nodes
•A Distance vector routing protocol requires that a
router informs its neighbors of topology changes
periodically
•The least cost between any two nodes is the
route with minimum distance
•Node maintains a vector (table) of minimum
distance to every nodes

3. •The table at each node also guides the packet to
the desired node by showing next stop in route
•Each node shares its routing table with its
immediate neighbors periodically and when there
is a change
•When a node receives a routing table from its
neighbors it updates is routing table.
•The routing table is shared both periodically and
when there is a change in the network
•The period of sharing routing table depends on
protocol using Distance Vector Routing.