So guys, now let us summarize what we have learned in this section of the course.
So each node in the network graph can independently run SBF algorithm on its link state packet database
in order to compute its local routing table.
Each SBF result table, which is the output of the phase two, is stored in the SBF root nodes, local
data structure, right.
So the end result is that that every node knows the next hop information to reach a remote destination.
In other words, every node can ping every other node via shortest path.
So algorithm looks after the ICMP case that we have already discussed and now there is an exercise for
you to find and explore the time and space complexity of the single source shortest path algorithm,
because this is a very much expected question in the interview.
The SPF algorithm is used by routing protocols, which are classified as interior gateway protocols
such as OSPF Is-Is.
Right.
So in the industry, if you are working on such protocols, you will know that these protocols internally
uses SPF algorithm for the computation of routing tables and all the phases that we discussed.
That is exchange of the hello packets, distribution of Neighborship database, construction of link,
state packet database, and then finally running SPF algorithm to compute the routing table.
All these phases are employed by interior gateway routing protocols.