A High-Speed Load-Balancer Design with Guaranteed Per-Connection-Consistency
summary
Cheetah embeds a per-connection server decision into a packet cookie (implemented as a stateless cookie in TCP timestamp or QUIC/IPv6 alternatives) so packets return with the server ID, guaranteeing PCC while allowing arbitrary selection policies. Implementations include a software LB that does 100 Gbps on 4 cores and a P4 Tofino prototype (dozens of Tbps potential). The stateless design runs 5× faster than a stateful hash table and cuts 99th‑percentile flow completion times by 2–3×.
AI-written summary · about
chapters (7)
- 0:00Start
- 0:15Load-balancer
- 1:20The challenge: Ensuring PCC
- 3:26CHEETAH IMPLEMENTATIONS
- 4:24CHEETAH Overview
- 6:05Stateless CHEETAH
- 8:15Stateful CHEETAH
related talks
21mStateless Datacenter Load-balancing with Beamer
21mImproving L4 Routing Consistency
23mBalancing on the Edge: Transport Affinity without Network State
46mKeeping the Balance: Load Balancing Demystified
16mFLB: Fine-grained Load Balancing for Lossless Datacenter Networks
18mCCC: Re-architecting Delay-based Congestion Control in Datacenter Networks
13mEdgeBalance: Model-Based Load Balancing for Network Edge Data Planes
41mLoad Balancing Roundup