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 Packet Pushers - Fat Pipe by Packet Pushers. Dijkstra’s algorithm is the foundation of shortest path calculations for link state routin...
Podcast
This episode belongs to Packet Pushers - Fat Pipe.
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 Packet Pushers - Fat Pipe.
NB574: Extreme’s New AI Agent Nudges You; Cloudflare Evaporates 20% of Employees
May 11, 2026 - 37:41
TNO062: SONiC for Open Networking with Jeff Doyle
May 8, 2026 - 1:02:02
LIU014: Linda Haviv: From Philosophy Major to AI Engineer
May 7, 2026 - 1:01:28
NAN121: Simplifying Network Automation with NetGru
May 6, 2026 - 52:36
PP108: How to Build and Sustain a Successful Zero Trust Project
May 5, 2026 - 51:15
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 Packet Pushers - Fat Pipe by Packet Pushers.
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 Packet Pushers - Fat Pipe?
Yes. This page shows related episodes from Packet Pushers - Fat Pipe 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 Packet Pushers - Fat Pipe by Packet Pushers.
What are the episode details?
Published May 1, 2026 and 54:43 long