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

Heavy Networking

B21 मई 202654 min

चलाएं

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 »

एपिसोड · Heavy Networking

HPE Self-Driving Networks: The Next Evolution of Network Automation (Sponsored)

C152 min

The State of Packet Pushers 2026

B21h 12m

AI Agents Are Just Another Tool: How to Integrate With Your Network Automation Strategy (Sponsored)

C145 min

The Sum, Not Just the Parts: How and Why to Think Holistically About Your Network

C155 min

Tailscale CEO on WireGuard, Zero Trust, and Securing AI (Sponsored)

C156 min

EVPN/VXLAN Vs. TradCore

C154 min

How Selector Unifies Cloud and On-Prem Network Observability (Sponsored)

C146 min

When Buffers Attack: Understanding Buffers to Better Diagnose Network Weirdness

C11h 12m

An Inside Look at Palo Alto Networks Prisma Browser for Business (Sponsored)

B234 min

That’s Not a Job for an LLM: The Right Way to Apply AI to Network Operations (Sponsored)

C21h 1m

Defining A Modern Network Service

C151 min

Now I Understand. You Mean an AI-Safe Zero-Trust Network Automation Approach. (Sponsored)

C11h 12m