Question

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 in 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 and S2 are true, but S3 is false.
• B. S1 and S3 are true, but S2 is false.
• C. S1, S2, and S3 are all true.
• D. S1, S2, and S3 are all false.

Answer 1

The correct option is B S1 and S3 are true, but S2 is false.

S1 is TRUE: Processing time in link state protocol is high because of link state database.
S2 is FALSE: Link state protocol is a loop free protocol. Link state protocol avoids persistent routing loops.
S3 is TRUE: Link state protocol is fast convergence because of link state database i.e.., it contains complete information of the network. This information is given to the router by the link state packets.