Two popular routing algorithms are Distance Vector(DV) and Link State (LS)…
GATE · 2008 · IT
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
- A.
S1, S2 and S4 only
- B.
S1, S3 and S4 only
- C.
S2 and S3 only
- D.
S1 and S4 only
Attempted by 411 students.
Sign up free to check your answer
Sign up freeLoading lesson…