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 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 »
Podzilla Summary coming soon
Sign up to get notified when the full AI-powered summary is ready.
Free forever for up to 3 podcasts. No credit card required.
Listen to This Episode
More from Heavy Networking
HN831: The Sum, Not Just the Parts: How and Why to Think Holistically About Your Network
HN830: Tailscale CEO on WireGuard, Zero Trust, and Securing AI (Sponsored)
HN829: EVPN/VXLAN Vs. TradCore
HN828: How Selector Unifies Cloud and On-Prem Network Observability (Sponsored)
Get summaries like this every morning.
Free AI-powered recaps of Heavy Networking and your other favorite podcasts, delivered to your inbox.
Free forever for up to 3 podcasts. No credit card required.