Exams › GATE › Technical
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 ?
- S1, S2, and S3 are all true.
- S1, S2, and S3 are all false.
- S1 and S2 are true, but S3 is false.
- S1 and S3 are true, but S2 is false.
Correct answer: S1 and S3 are true, but S2 is false.
Solution
Link state protocols require more computational resources because they maintain a complete view of the network topology, leading to higher overhead compared to distance vector protocols, which only share information with neighbors. Additionally, link state protocols can quickly adapt to changes in the network, resulting in faster convergence after topology changes. However, distance vector protocols can indeed avoid persistent loops with techniques like split horizon, which is not a limitation of link state protocols.
Related GATE Technical questions
⚔️ Practice GATE Technical free + battle 1v1 →