HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie
About this episode
Dr. Bruce Davie discusses a new algorithm that may improve upon Dijkstra’s algorithm for shortest path calculations.
Dijkstra’s algorithm is the foundation of shortest path calculations for link state routing protocols. But researchers have developed a new algorithm that improves on this decades-old approach. Today’s Heavy Networking welcomes Dr. Bruce Davie to discuss the potential of this new algorithm to unseat Dijkstra. After thoughtful consideration, and consultation with others, his opinion is ... Read more »
Topics covered
- shortest path algorithm
- Dijkstra's algorithm
- link state routing
- networking
- algorithm improvement
More episodes of The Everything Feed - All Packet Pushers Pods
Explore listener stats, chart rankings, contacts and more on the The Everything Feed - All Packet Pushers Pods podcast page.