Skip to content

Articles

Engineering articles on rate limiting, distributed systems, and Valve’s design.

6 articles, newest first

More articles

  1. Atomic vs Sequential Rate Limiting: Why All-or-Nothing Admission Matters

    How sequential reservations spend quota before a request can run, and when one atomic admission is the right boundary.

    7 min readSaurav K.

  2. Bottleneck vs Valve: Two Different Philosophies of Rate Limiting

    Compare scheduler composition with atomic provider-budget admission, including pacing, groups, concurrency, retries, and Redis ownership.

    7 min readSaurav K.

  3. One API Request, Multiple Rate Limits: Modeling Overlapping Quotas

    Model shared, tenant, and recipient quotas with scoped rules, explicit bursts, and a daily counter.

    7 min readSaurav K.

  4. Why Strict Rate Limiting Can Reduce Throughput

    How strict GCRA pacing turns scheduling delays into unused capacity, with a local probe for measuring grants and callback starts.

    7 min readSaurav K.

  5. The Thundering Herd Problem in Redis-Backed Rate Limiters

    Why workers retry against one shared Redis budget, how Valve schedules those attempts, and how to measure contention.

    8 min readSaurav K.