HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie

HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie

From The Fat Pipe - Most Popular Packet Pushers Pods by Packet Pushers

May 1, 2026 · 55 min

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 »

People in this episode

Host: Packet Pushers

Guest: Bruce Davie

Topics covered

  • shortest path algorithm
  • Dijkstra's algorithm
  • link state routing
  • networking
  • algorithm improvement

Keywords

  • shortest path
  • Dijkstra
  • routing protocols
  • network algorithms
  • Bruce Davie

Mentioned in this episode

Organizations: Packet Pushers

Books & works: Dijkstra’s algorithm

More episodes of The Fat Pipe - Most Popular Packet Pushers Pods

Explore listener stats, chart rankings, contacts and more on the The Fat Pipe - Most Popular Packet Pushers Pods podcast page.