System Design
05Design patternsRate limiting

05 · Reusable pattern

Rate limiting

Translate product quotas and protection goals into enforceable distributed budgets.
8 minConcept guideReference-informed · independently authored
01

Lesson spine

What you need to understand.

Distributed rate limiting is a policy hierarchy plus a counter-consistency decision.

01

Policy layers

Combine coarse IP or tenant protection at the edge with fine user, endpoint, or cost limits inside the service.

02

Atomic decision

Update and test quota state in one operation; separate reads and writes allow concurrent requests to overshoot unpredictably.

03

Regional budgets

Allocate a fraction of a global quota to each region and periodically rebalance for resilience with bounded overshoot.

04

Cost-weighted limits

Charge different token costs for expensive operations instead of pretending every request consumes equal capacity.

05

Client contract

Return a stable 429 response, remaining budget where safe, and retry timing; never turn throttling into mysterious timeouts.

06

Operate the limiter

Measure decision latency, allowed and denied volume, hot identities, policy propagation, and fail-open use.

02

Before the boxes

Frame the decision.

Outcome

What must work

Translate product quotas and protection goals into enforceable distributed budgets.

Scale

What changes the design

Active keys · update rate · decision p99 · overshoot · policy propagation

Boundary

What owns the truth

Identify the component that commits authoritative state, then separate synchronous confirmation from derived work.

Non-goal

What stays simple

Do not add global coordination, multi-region writes, or a specialized store until a requirement earns the complexity.

03

Architecture map

Trace ownership, not just traffic.

Rate limiting · concept mechanism

Walk one representative request across every arrow. Say whether the handoff is synchronous or asynchronous, what identity makes a retry safe, and which step changes authoritative state.

  1. 01

    Identity — Resolves user and tenant Define the output contract before moving to the next owner.

  2. 02

    Policy — Selects quota Define the output contract before moving to the next owner.

  3. 03

    Counter — Updates window Define the output contract before moving to the next owner.

  4. 04

    Decision — Allows, queues, or rejects Define the output contract before moving to the next owner.

  5. 05

    Response — Returns reset guidance Define the output contract before moving to the next owner.

  6. 06

    Analytics — Detects systematic throttling Confirm the result and emit the evidence needed to reconcile it.

04

Decision table

Make the trade-offs explicit.

DecisionDefensible positionCost to acknowledge
Primary mechanismGlobal quotas require coordination; regional budgets trade bounded overshoot for resilience.The stronger guarantee usually adds coordination, latency, state, or operational work.
Sync vs. asyncKeep only correctness-critical confirmation synchronous. Move derived views, notifications, analytics, and cleanup behind a durable boundary.Async work needs idempotency, lag monitoring, replay, and a product definition for partial completion.
Simple vs. scaledBegin with one logical owner and a clear API. Partition or replicate only the resource proven to be the first bottleneck.Migration requires stable identities, versioned contracts, backfill, and a rollback path.
05

Failure review

Design the recovery path.

DetectBoundRetry safelyReconcileLearn

Topic-specific risk

Bad identity keys and synchronized windows enable evasion or reset spikes.

Response

Persist enough identity and state to distinguish retry, resume, compensation, and operator repair.

Dependency timeout

A timeout is ambiguous: the remote side may have failed, succeeded, or still be running.

Response

Use deadlines, bounded backoff with jitter, idempotency keys, and a status or reconciliation path.

Overload or skew

Average capacity can look healthy while a tenant, key, partition, region, or expensive request saturates one owner.

Response

Expose queue depth and hot-key share, apply backpressure, isolate tenants, and degrade optional work before correctness.

06

Evidence + level bar

Prove the design can be operated.

Core signals

Health of the promise

Measure user-visible latency or freshness, correctness drift, saturation, retry volume, and time to recover. Alert on the failed promise—not only CPU.

Mid-level

Complete and clear

Finish the happy path, identify the state owner, choose reasonable building blocks, and explain one scale mechanism.

Senior

Trade-offs and failure

Separate read and write paths, define consistency, explain partitioning, and make duplicate or partial failure safe.

Staff+

Evolution and operations

Discuss multi-region boundaries, migration, tenant isolation, capacity, observability, and how the architecture changes over time.

07

Interview language

Open the deep dive with a claim.

“For Rate limiting, the decision I want to make explicit is this: Global quotas require coordination; regional budgets trade bounded overshoot for resilience. I’ll trace the state-changing path first, show where the result becomes durable, then test the design against the highest-risk failure and our target scale.”

08 · Retrieval check

Can you defend it without the page?

  1. For Rate limiting, where is the correctness boundary and which failure would you test first?
  2. Which component owns committed truth, and what event or response proves the commit?
  3. Where is the first scaling or coordination bottleneck under the stated envelope?
  4. What happens after an ambiguous timeout or duplicate operation?
  5. Which complexity would you remove at one hundredth of the scale?