At the heart of OSPF is the SPF calculation. See how the Dijkstra algorithm turns the network into a tree, then picks out best routes.
What you'll learn from this video:
The OSPF protocol passes around Router and Network LSAs to build up a so called "Topological Database", from which the magic of the Dijkstra algorithm can calculate IP routes. But, what does the Topological Database actually store? How can an algorithmic manipulation calculate routes from this database?
This animation presents an example of how a network can be represented as a set of "Jigsaw Pieces" that can be re-arranged into a least-cost tree, from which it is then easy to find the least-cost route to any subnet.
What you'll learn from this video:
The OSPF protocol passes around Router and Network LSAs to build up a so called "Topological Database", from which the magic of the Dijkstra algorithm can calculate IP routes. But, what does the Topological Database actually store? How can an algorithmic manipulation calculate routes from this database?
This animation presents an example of how a network can be represented as a set of "Jigsaw Pieces" that can be re-arranged into a least-cost tree, from which it is then easy to find the least-cost route to any subnet.
- Category
- Allied Telesis
- Tags
- OSPF, dijkstra algorithm, networking
Be the first to comment