Scribd
Upload
76 views

The Distance Vector Routing

Distance vector routing is a dynamic routing algorithm where each router maintains a routing table with the preferred outgoing line and estimated distance to reach each destination router. The router knows the distance to its neighbors. Periodically, each router shares its routing table with neighbors, calculates total distances, and updates its table with the shortest paths. For example, router J measures delays to its direct neighbors A, I, H, K and calculates the minimum delay path to other routers like G by summing the direct neighbor delay and delays in the neighbors' routing tables. The shortest path from J to G is the route through H with a delay of 18 milliseconds.

Uploaded by

Mouli Mandal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
76 views

The Distance Vector Routing

Distance vector routing is a dynamic routing algorithm where each router maintains a routing table with the preferred outgoing line and estimated distance to reach each destination router. The router knows the distance to its neighbors. Periodically, each router shares its routing table with neighbors, calculates total distances, and updates its table with the shortest paths. For example, router J measures delays to its direct neighbors A, I, H, K and calculates the minimum delay path to other routers like G by summing the direct neighbor delay and delays in the neighbors' routing tables. The shortest path from J to G is the route through H with a delay of 18 milliseconds.

Uploaded by

Mouli Mandal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Distance Vector Routing

The distance vector routing known as Bellman-Ford routing or Ford-Fulkerson


routing is a dynamic routing algorithm. Each router maintains a routing table indexed by
and containing one entry for each router in the subnet. This entry contains two parts: the
preferred outgoing line to use for that destination and an estimate of the time or distance
to that destination. The router is assumed to know the distance of each of it’s neighbors.
The metric used may be number of hops, time delay, total queue length etc.

Example:
Let delay is used as metric and the router knows the delay to each of it’s
neighbors. Once in every T msec each router sends to each neighbor, a list of it’s
estimated delays to each destination and also receives the similar list from each neighbor.
The delays are added to get the total delay.

A B C D

F G
E H

I J K L
To A I H K J

From
A 0 24 20 21 8 A
B 12 36 31 28 20 A
C 25 18 19 36 28 I
D 40 27 8 24 20 H
E 14 7 30 22 17 I
F 23 20 19 40 30 I
G 18 31 6 31 18 H
H 17 20 0 19 12 H
I 21 0 14 22 10 I
J 9 11 7 10 0 -
K 24 22 22 0 6 K
L 29 33 9 9 15 K

JA JI JH JK
delay 8 delay 10 delay 12 delay 6
Note:
• First calculate the direct neighbor. Vary the delay w.r.t distance. A→A is always
0.
• To compute the optimal path from J to G, first find the nodes which are neighbors
of J i.e. A, I, H, K.
• In each table only minimum value of delay is entered. J has to only measure the
delay of it’s neighbor. Rest of the values are calculated as follows.
Let J itself measured the delay to it’s neighbors . A=8, I=10, H=12 and k=6 msec. Now
let us compute the new route from J to G. The routes are :
1) J→A→G = (8+18) = 26 msec.
2) J→I→G = (31+10) = 41 msec.
3) J→H→G = (6+12) = 18 msec.
4) J→K→G = (31+6) = 37 msec.
The best minimum is 18 which is through H.

You might also like