The GATE Grind

GATE 2014 CS (CS1) – Question 33

Computer Networks · Routing: Distance Vector and Link State Routing · 1 mark · Multiple choice

For link-state and distance-vector routing in a network of 500 nodes and 4000 links: S1: Link-state has higher computational overhead. S2: Distance-vector with split horizon avoids persistent routing loops, but link-state does not. S3: After topology changes, link-state converges faster. Which is correct?

  1. S1, S2, S3 all true
  2. S1, S2, S3 all false
  3. S1, S2 true; S3 false
  4. S1, S3 true; S2 false

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (D) S1, S3 true; S2 false

Explanation

Link-state routing computes shortest paths using a network topology, normally with greater computation but faster convergence. Split horizon reduces certain distance-vector loops but does not eliminate persistent multi-router loops in general. Therefore S1 and S3 are true while S2 is false, **D**, under the conventional protocol comparison.