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

Heavy Networking · May 1, 2026 · 54:43

0:0054:43

Listen in the Podli app 🎧

Follow your favourite podcasts, listen offline and in the car with CarPlay and Android Auto, and always pick up where you left off. Free to try.

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 »

← HN824: That’s Not a Job for an LLM: The Right Way to Apply… HN826: An Inside Look at Palo Alto Networks Prisma Browser… →

Episodes: Heavy Networking

PodliGet the free Podli app

↓ App