Follow Us :

Functions of OSI and TCP/IP Layers Q.47

0. 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?

  • Option : D
  • Explanation : Statement S1
    The Distance Vector routing protocols rely on the information from their directly connected neighbours in order to calculate and accumulate route information. Distance Vector routing protocols require very little overhead as compared to Link State routing protocols as measured by memory and processor power while the Link State routing protocols do not rely solely on the information from the neighbours or adjacent router in order to calculate route information. I nstead, Link State routing protocols have a system of databases that they use in order to calculate the best route to destinations in the network. This is TRUE
    Statement S3
    Distance Vector exchanges the routing updates periodically whether the topology is change or not, this will maximize the convergence time which increases the chance of routing loops while the Link State routing protocols send triggered change based updates when there is a topology change. After initial flood, pass small event based triggered link state updates to all other routers. This will minimize the convergence time that’s why there is no chance of routing loops. This is TRUE.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *