Consider the following three statements about link state and distance vector…
GATE · 2014 · CS · Set 1 · Computer Science & IT
Consider the following three statements about link state and distance vector routing protocols, for a large network with 500 network nodes and 4000 links.
[S1] The computational overhead in link state protocols is higher than in distance vector protocols.
[S2] A distance vector protocol (with split horizon) avoids persistent routing loops, but not a link state protocol.
[S3] After a topology change, a link state protocol will converge faster than a distance vector protocol.
Which one of the following is correct about S1, S2, and S3 ?
- A.
S1, S2, and S3 are all true.
- B.
S1, S2, and S3 are all false.
- C.
S1 and S2 are true, but S3 is false.
- D.
S1 and S3 are true, but S2 is false.
Attempted by 246 students.
Sign up free to check your answer
Sign up freeLoading lesson…