Distance vector

Question

In distance vector routing how the distance vectors are update when two paths have same cost

eg. Initial Distance vector of A B C D are

A-   [0 ∞ 1 2]

B-  [∞ 0 3 2]

C-  [1 3 0 ∞]

D-  [2 2  ∞ 0]

what will be distance vector of A after 1 iteration. Please mention via node and why u choose that node??

Answer 1

After 1 iteration, A will have 2 choices to go to Node B, either with the help of Node D(2 + 2) or Node C(3 + 1).

As far as I think it depends on the implementation as to which node A will choose as its next hop in such a case.

@Arjun sir ?

Comments

There are some parameter sequence which are matched...for eg

1- cost

2- link having low cost to next hop

2-  link with maximum bandwidth

3- no. of hops etc.

Answer 2

first of all the initial distances as per the routing table are 

A is connected to C and D

B is connected to C and D

C is connected to A and B

D is connected to A and B

 

distance between A-C is 1

distance between A-D is 2

distance between C-B is 3

distance between B-D is 2

 

at 1^st exchange

routing table of A is [0,4,1,2]

routing table of B is [4,0,3,2]
routing table of C is [1,3,0,3]

routing table of D is [2,2,3,0]