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

EPISODE · May 1, 2026 · 54 MIN

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

from The Fat Pipe - Most Popular Packet Pushers Pods · host 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 metadata supplied by the publisher feed · Published May 1, 2026

Embed this episode

NOW PLAYING

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

0:00 54:43

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

How long is this episode of The Fat Pipe - Most Popular Packet Pushers Pods?

This episode is 54 minutes long.

When was this The Fat Pipe - Most Popular Packet Pushers Pods episode published?

This episode was published on May 1, 2026.

Can I download this The Fat Pipe - Most Popular Packet Pushers Pods episode?

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