The computation of the shortest path in OSPF is usually done by
A) bellman-ford algorithm
B) routing information protocol
C) dijkstra's algorithm
D) distance vector routing
Correct Answer:
Verified
Q15: In Unicast routing, if instability is between
Q16: RPF stands for
A)reverse path forwarding
B)reverse path
Q17: LSP stands for
A)link stable packet
B)link state
Q18: Protocol is a set of
A)formats
B)procedures
C)formats & procedures
D)none
Q19: Several techniques can make size of routing
Q20: Host-specific routing is used for purposes such
Q21: In Unicast Routing, Dijkstra algorithm creates a
Q22: In Multicast Routing Protocol, flooding is used
Q24: Which of the following is false with
Q25: In OSPF, which protocol is used to
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents