The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
199 views

 

 

 

 

 

 

 

 

 

 

 

 

 

       D. 

 

asked in Computer Networks by Loyal (8.7k points) | 199 views
0
Option b??

Also can you please add test series name
0
B is the correct answer
+1

@Magma B is true but i have a doubt as in question its written that P has measured its distance to Q,R,S as 3,7,2 so we'll modify that distance too while sharing or we'll keep it ? In tanenbaum they kept that distance and in one of the GATE question too or was it because if i try to find the distance of those neighbours again i'll get the same entry ?

0
Am I saying something wrong ? Please help me here :)
0
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
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
Brother what's the link value here u talking ?

1 Answer

+1 vote

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)

 

 

 

answered by (169 points)

Related questions

0 votes
1 answer
4
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,427 questions
53,611 answers
185,914 comments
70,885 users