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

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 »

You can listen to HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie online on Radio and Podcast. Open the player on this page to stream the available audio.

HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie is an episode from Packet Pushers - Weekly Show by Packet Pushers.

This episode is 54:43 long.

This episode was published on May 1, 2026.

Yes. Use the heart button on the episode page to add it to your favorite episodes list.

Yes. This page shows related episodes from Packet Pushers - Weekly Show when more episodes are available from the podcast feed.