9,469 views
33 votes
33 votes

Two popular routing algorithms are Distance Vector(DV) and Link State (LS) routing. Which of the following are true?

(S1):  Count to infinity is a problem only with DV and not LS routing
(S2):  In LS, the shortest path algorithm is run only at one node
(S3):  In DV, the shortest path algorithm is run only at one node
(S4):  DV requires lesser number of network messages than LS

  1. S1, S2 and S4 only
  2. S1, S3 and S4 only
  3. S2 and S3 only
  4. S1 and S4 only

4 Answers

Best answer
30 votes
30 votes

S1 is true, S2 and S3 are false and S4 is true. 

Link State: https://cseweb.ucsd.edu/classes/fa10/cse123/lectures/123-fa10-l12.pdf

Distance Vector: http://cseweb.ucsd.edu/classes/fa10/cse123/lectures/123-fa10-l13.pdf

Correct Answer: $D$

edited by
17 votes
17 votes
Count to infinity problem only exist into the DVR.

In LSR shortest path is calculated at each and every router so option B is wrong.

Similar case also arise for the DVR so option C is also wrong.

Since DVR is based upon local knowledge whereas LSR is based upon global knowledge.
0 votes
0 votes
Answer (D)
0 votes
0 votes
Count to Infinity problem has only direct connection with DV algorithm. As Good information spreads slow and bad information spreads faster. This count to infinity problem has no link with LS Algorithm.

DV requires lesser number of network messages then LS as DV is a static algorithm.

So rest information in question is not valid so only A and D are true
Answer:

Related questions

54 votes
54 votes
8 answers
2
Ishrat Jahan asked Oct 29, 2014
11,779 views
Host $X$ has IP address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to an­other host $Y$ with IP address $192.168.1.80$. Router $R1$ has IP address...