The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
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 flooding
$S3:$ DV suffers from the count to infinity problem
  1. Only $S1$
  2. Only $S1$ and $S3$
  3. $S1$ and $S2$
  4. Only $S2$ and $S3$
asked in Computer Networks by Boss (17.2k points) | 67 views

1 Answer

+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.
answered by Boss (11k points)
0
do link state routing flooding ?
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,070 questions
53,206 answers
184,550 comments
70,420 users