in Computer Networks
2,364 views
1 vote
1 vote

 

 

 

 

 

 

 

 

 

 

 

 

 

       D. 

 

in Computer Networks
by
2.4k views

4 Comments

I don't think that will be changed but if we find a better path we change the path as you can observe in count to infinity problem.

the link value should never be changed but the path might change.
0
0
Link value ?? Are u talking about the entry in which we store the name of the router from which we got the best new distance ?
0
0
Brother what's the link value here u talking ?
0
0

1 Answer

2 votes
2 votes

Link costs maintained by P: 

(-,3,7,2,-,-) (in the PQRSTU order)

Distance vectors received by P

Q:(3,0,1,4,7,5)

R:(7,4,0,6,8,7)

S:(2,5,7,0,4,2)

Bellman ford equation is :

Dx(y) = min { C(x,v) + Dv(y)} for each node y ∈ N

Hence distance vector of P becomes 

(0,min(3+0,7+4,2+5),min(3+1,7+0,2+7),min(3+4,7+6,2+0),min(3+7,7+8,2+4),min(3+5,7+7,2+2))

=(0,3,4,2,6,4)

 

 

 

Related questions