The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+26 votes

Consider a network with $6$ routers $R1$ to $R6$ connected with links having weights as shown in the following diagram.

Suppose the weights of all unused links are changed to $2$ and the distance vector algorithm is used again until all routing tables stabilize. How many links will now remain unused?

  1. $0$
  2. $1$
  3. $2$
  4. $3$


asked in Computer Networks by Veteran (97.7k points)
edited by | 3.2k views

6 Answers

+29 votes
Best answer

First we need to find which are the unused links in the graph
For that we need not make distance vector tables,
We can do this by simply looking into the graph or else DVT can also give the answer.
So, $R1-R2$ and $R4-R6$ will remain unused.

Now If We changed the unused links to value $2$.
$R5-R6$ will Now remain unused.

So, the correct answer is option B).

answered by Active (4.4k points)
edited by
I think no link will remain unused as routing tables of r6 and r5 will not be updated for 2+1=3 because their distance already 3.
Yes the answer should be (a)

when cost of two paths are same then we consider hop count which is less for R5-R6.So, there are no unused links right?
+18 votes

Only one link is not used

answered by Boss (21.2k points)
+6 votes

The links R1-R2  and R4-R6 will never be used for data transfer because there are shorter paths available in any case.
If those two link weights are changed to 2, now only one link ie R5-R6 will never be used.

answered by Junior (621 points)
+6 votes

SImple reason for this.Use your intuition like below way

Find all the shortest path from each node to other and mark your visited edge .Then automatically in first searching u will find that only two edge are unused example edge R1---->R2 as well as R4---->R6.

When u change it into 2,Then again apply your intuition to find out shortest path from each node to other in this satuation u again find on link is unused.
answered by Loyal (9.7k points)
0 votes

Ans is B 


answered by Junior (627 points)
edited by
0 votes
As DVR is same as Dijkstra algorithm, so simply make Minimum cost spanning tree and then first confirm it by manually traversing for each source to Destination to confirm that it's same as that we'll get using SSSP, as Greedy need not be Optimal, so after it just the ones not in mst will be unused.
answered by Junior (651 points)

Related questions

0 votes
1 answer
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,811 questions
54,533 answers
75,580 users