67 views
Which of the following statements is false about $\text{link state routing (LS)}$, and $\text{distance vector routing (DV)}$
$S1:$ LS, DV both requires each router to obtain a map of the complete topology
$S2:$ DV requires ﬂooding
$S3:$ DV suﬀers from the count to inﬁnity problem
1. Only $S1$
2. Only $S1$ and $S3$
3. $S1$ and $S2$
4. Only $S2$ and $S3$

+1 vote
DV do not require a map of complete topology. Each node in DV learns topology of its neighbours only.

DV do not require flooding and DV suffers from count to infinity problem.
0
do link state routing flooding ?

1
2
3
5