Q67

Two popular routing algorithms are Distance Vector(DV) and Link State (LS) routing. Which of the following are true? (S1): Count to infinity is a problem only with DV and not LS routing (S2): In LS, the shortest path algorithm is run only at one node (S3): In DV, the shortest path algorithm is run only at one node (S4): DV requires lesser number of network messages than LS