Radio and PodcastLive Radio & PodcastsTechnology
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 Networ...
About This Episode
HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie is an episode from The Fat Pipe Of The Packet Pushers Podcasts by The Packet Pushers Team. Dijkstra’s algorithm is the foundation of shortest path calcula...
Podcast
This episode belongs to The Fat Pipe Of The Packet Pushers Podcasts.
Listen Online
Use the player on this page to stream the episode online.
Episode Details
Published May 1, 2026, 54:43 long, audio available.
Related Episodes
Continue listening to more episodes from The Fat Pipe Of The Packet Pushers Podcasts.
HN830: Tailscale CEO on WireGuard, Zero Trust, and Securing AI (Sponsored)
Jun 5, 2026 - 56:39
TNO064: The Realities of Running SONiC at Scale
Jun 5, 2026 - 56:26
LIU016: Michael Keith Lewis: The Network Behind the Show
Jun 4, 2026 - 1:11:27
NAN124: AI and Trust in Modern Network Automation
Jun 3, 2026 - 54:49
N4N056: A Wireless NAC Walkthrough
May 28, 2026 - 1:10:54
TNO063: Automating Human-Centric NetOps is Finally Achievable
May 22, 2026 - 54:19
LIU015: Eyvonne Sharp: From Farm Roots to the Cloud
May 21, 2026 - 47:05
Questions About This Episode
What is HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie about?
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 »
Where can I listen to HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie?
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.
Which podcast is HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie from?
HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie is an episode from The Fat Pipe Of The Packet Pushers Podcasts by The Packet Pushers Team.
How long is this episode?
This episode is 54:43 long.
When was this episode published?
This episode was published on May 1, 2026.
Can I save HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie for later?
Yes. Use the heart button on the episode page to add it to your favorite episodes list.
Are there related episodes from The Fat Pipe Of The Packet Pushers Podcasts?
Yes. This page shows related episodes from The Fat Pipe Of The Packet Pushers Podcasts when more episodes are available from the podcast feed.
Quick Answers About This Episode
Where can I listen to HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie?
You can listen to HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie on this page when the episode audio is available from the podcast feed.
Which podcast is this episode from?
HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie is from The Fat Pipe Of The Packet Pushers Podcasts by The Packet Pushers Team.
What are the episode details?
Published May 1, 2026 and 54:43 long