HN825: Faster Than Dijkstra? Exploring a New Shortest-Path Algorithm with Bruce Davie
From Heavy Networking by Packet Pushers
May 1, 2026 · 55 min · Episode 825
About this episode
Dr. Bruce Davie discusses a new algorithm that may improve upon Dijkstra’s algorithm for shortest path calculations.
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 »
People in this episode
Host: Packet Pushers
Guest: Bruce Davie
Topics covered
- shortest path algorithm
- link state routing
- Dijkstra's algorithm
- networking
- routing protocols
Keywords
- shortest path
- Dijkstra
- algorithm
- networking
- routing
- link state
Mentioned in this episode
Books & works: Dijkstra’s algorithm
More episodes of Heavy Networking
- HN831: The Sum, Not Just the Parts: How and Why to Think Holistically About Your Network · June 12, 2026 · 56 min
- HN830: Tailscale CEO on WireGuard, Zero Trust, and Securing AI (Sponsored) · June 5, 2026 · 57 min
- HN829: EVPN/VXLAN Vs. TradCore · May 29, 2026 · 54 min
- HN828: How Selector Unifies Cloud and On-Prem Network Observability (Sponsored) · May 22, 2026 · 46 min
- HN827: When Buffers Attack: Understanding Buffers to Better Diagnose Network Weirdness · May 15, 2026 · 1h 13m
- HN826: An Inside Look at Palo Alto Networks Prisma Browser for Business (Sponsored) · May 8, 2026 · 35 min
Explore listener stats, chart rankings, contacts and more on the Heavy Networking podcast page.