Computer Networks » Ls Routing Algorithms
Which routing algorithm was replaced by link state routing algorithm in the ARPANET?
A. Path routing
B. Distance vector routing
C. Broadcast routing
D. Multicast routing
Read more about this MCQ
What is flooding in link state routing in case of exchanging topology information?
A. Exposing routing tables to neighbors
B. Sending duplicate packets to nodes
C. Communicating with every router using messages
D. Spreading link state packets
Read more about this MCQ
Which information in the link state packets helps in discarding old link state packets?
A. Information about topology
B. Sequence number
C. Age
D. Number of nodes it visits
Read more about this MCQ
Which sequence of procedure is correct to build a routing table in link state routing?
A. Creating lsp €? flooding €? shortest path tree €? calculating routing table
B. Shortest path tree €? flooding €? creating lsp €? calculating routing table
C. Creating lsp €? flooding €? calculating routing table €? shortest path tree
D. Shortest path tree €? flooding €? calculating routing table -creating lsp
Read more about this MCQ
Which of the following is an advantage of the link state routing?
A. Uses more memory
B. Flood of advertisements
C. Less routing loops
D. Need for administrator
Read more about this MCQ
What is the full form of LSA in link state routing, which is used to exchange information between routers?
A. Line state autonomy
B. Line state advertisement
C. Link state advertisement
D. Link sate for autonomous
Read more about this MCQ