This article explains how OSPF algorithm uses the shortest path to determine the best route to a destination. In this algorithm, the best route is the least cost. The algorithm was developed by Dijkstra, a Dutch computer specialist in 1959.
The algorithm considers the network as a set of nodes connected by point to point links. Each link has a cost. Each node has a name. Each node has a comprehensive database of all links and therefore knows the physical topology information in its entirety. All database link-state within a given area are identical. Read the rest of this entry »
