search
Log In
33 votes
5k views

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$

 

in Computer Networks
edited by
5k views
0

@Bikram  ans 1 ?? 

7 Answers

36 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).


edited by
4
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.
0
Yes the answer should be (a)
0
@bad_engineer

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?
0
Answer would be zero instead of 1.
0

@kp1

No! R5---R6 edge is never present in any shortest path between any two pairs of nodes.

Hence B)1  is the correct answer.

1

@rohith1001 yes u r right. Actually in previous year book there is a misprint ( it is given cost of R5-- R6 link is 3) so if u take 3 then answer will be zero.. But in the actual question R5--R6 link is 4. Thus answer will be 1.

22 votes

Only one link is not used

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.

6 votes
Option-B

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.
1 vote

Ans is B 

now


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.
0 votes
Please correct the question in your text book who thinks answer should be 0

Distance between R5 and R6 is 4 and not 3 as asked in gate 2010 please correct the question
Answer:

Related questions

46 votes
6 answers
1
7.6k views
Consider a network with $6$ routers $R1$ to $R6$ connected with links having weights as shown in the following diagram. All the routers use the distance vector based routing algorithm to update their routing tables. Each router starts with its routing table initialized to contain an entry ... tables stabilize, how many links in the network will never be used for carrying any data? $4$ $3$ $2$ $1$
asked Sep 30, 2014 in Computer Networks jothee 7.6k views
36 votes
5 answers
2
7.8k views
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ N2: $(1, 0, 6, 7, 3)$ ... $N1$ in the distance vector of $N3$ ? $3$ $9$ $10$ $\infty$
asked Apr 21, 2016 in Computer Networks jothee 7.8k views
13 votes
3 answers
3
2k views
Count to infinity is a problem associated with: link state routing protocol. distance vector routing protocol DNS while resolving host name TCP for congestion control
asked Nov 3, 2014 in Computer Networks Ishrat Jahan 2k views
35 votes
4 answers
4
7.7k views
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ N2: $(1, 0, 6, 7, 3)$ N3: $(7, 6, 0, 2, 6)$ N4: $(8, 7, 2, 0, 4)$ ... at node, $N3$? $(3, 2, 0, 2, 5)$ $(3, 2, 0, 2, 6)$ $(7, 2, 0, 2, 5)$ $(7, 2, 0, 2, 6)$
asked Sep 29, 2014 in Computer Networks jothee 7.7k views
...