NETWORK LAYER
INTRODUCTION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Bellman-ford algorithm
|
|
|
Routing information protocol
|
|
|
Dijkstra’s algorithm
|
|
|
Distance vector routing
|
Detailed explanation-1: -Explanation: Shortest path in OSPF is usually computed by Dijkstra’s algorithm. It was proposed by Edsger W. Dijkstra in the year 1956. It is a greedy method algorithm and hence may not guarantee the shortest path every time, but is really fast.
Detailed explanation-2: -Normally in routing applications, Dijkstra’s algorithm is used to find the shortest route between 2 locations. This is the case with Map Suite Routing’s built-in Dijkstra routing algorithm.
Detailed explanation-3: -This routing algorithm used by Border Gateway Protocol(BGP). Link-state protocols such as IS-IS and OSPF rely on each router to advertise the state of each link to every router within the local network. Hence, the correct answer is “option 4".