What is the Power of Two Choices (P2C) algorithm and why is it preferred over round robin?
P2C picks two random healthy candidate endpoints on every request and dispatches the RPC to the endpoint with fewer outstanding active requests. This simple $O(1)$ decision prevents herd behavior, avoids thundering herds, and achieves near-optimal load distribution.
Answered in
Client-Side Load Balancing on Kubernetes: Why gRPC Traffic Skews and How Databricks Routes Per RequestHow Databricks eliminated gRPC traffic skew in Kubernetes: custom xDS control plane, client-side P2C routing, zone-affinity, and slow-start ramp-up.
Read the full analysisOther questions this article answers
More cloud infrastructure questions
- Why does Kubernetes kube-proxy cause traffic skew with gRPC workloads?
- How does client-side load balancing solve the gRPC connection pinning problem?
- What is the role of Envoy Discovery Service (EDS) and xDS in Databricks' architecture?
- Does multi-zone deployment guarantee high availability?
- What is static stability in a multi-zone design?
- Does quorum prevent every database split brain?
- What is the core architectural difference between a hypervisor and a container runtime?
- Why do containers introduce higher security risks in multi-tenant environments?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the Cloud Infrastructure beat.