edited by
23,677 views
61 votes
61 votes

Consider a network with $6$ routers $\textbf{R1}$ to $\textbf{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 for each neighbor with the weight of the respective connecting link. After all the routing tables stabilize, how many links in the network will never be used for carrying any data?

  1. $4$
  2. $3$
  3. $2$
  4. $1$
edited by

7 Answers

2 votes
2 votes

This kind of question should always be dealt with SMARTNESS

We will observe that the following image is the best option for going to every other router in shortest possible cost.

0 votes
0 votes
such type of question anyone can do by using trandational approch
but there is a quick way to do this.
--------------------------------------------------------------------------------------------------------------------
just take anyone router in our case assume R1 now try to go from this router to every other router

and try to list all used link and unused link
when we will go from R1—to all remaning link then used link are(here cost are diffrent so i will only do numering for used and unused link)
R1 used =3 2 7 9 4
and unused link are :-1 6 8
now what we will do here now we will focus only on unused link that R1 not used
we will try to see it is possible remaning node can used thes path.
------------------------------------------------------------------------------------------------------------------------
so ,here  now if you will send from R5 -R6 then 1 will used now we are left with only 8 and 6
--------------------------------------------------------------------------------------------------------------------------------
now focus on 8 what what does it says if you are at R4 so you can go to R6 by using 8 cost or you can also go to R5 via R6 with cost of 8+4 but you ask yourself is it minimum.

--------------------------------------------------------------------------------------------------------- ---------------
now if you are at R5 then you can go to R6 with cost 5 which is better then 8 and if you are at R4 also you can go to R6 with cost 4 which is definetly better than 1+8.

so from here we can say 8 is never going to used.in same way  at 6 you can apply this technique and you can make sure this link also never going to used
Answer:

Related questions