Skip to content
HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie episode artwork

May 1, 2026 54 min

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

from The Everything Feed - All Packet Pushers Pods Hosted by Daniel Mudge

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 »

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

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

0:00 54:43

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

How long is this episode of The Everything Feed - All Packet Pushers Pods?

This episode is 54 minutes long.

When was this The Everything Feed - All Packet Pushers Pods episode published?

This episode was published on May 1, 2026.

Can I download this The Everything Feed - All Packet Pushers Pods episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.