When Rate Limiting Is the Wrong Choice

Cost Controls: The first thing to settle is the failure mode, not the happy path. Cost Controls: Measurements taken once are anecdotes; you need a baseline that repeats. Cost Controls: Costs usually concentrate in a small number of operations, so find those first.

Release Process: You can often replace a coordination problem with an idempotency key. Release Process: Anything that grows without a bound will eventually hit one. Release Process: Documentation that is not tested tends to describe the previous version.

The interesting number is not the average, it is the 99th percentile. The same reasoning holds for schema migration. For schema migration, the constraint matters more than the feature list. Adding a cache in front of a slow query is a fix; fixing the query is a cure. Teams working on schema migration usually discover this the hard way. Every abstraction you add is a place where behaviour can differ from intent.

Observability: If a metric has no owner, it will drift until it causes an incident. Observability: The cheapest optimisation is usually removing work nobody asked for. Observability: Aggregating at write time trades flexibility for predictable read cost.

Edge Caching: The first thing to settle is the failure mode, not the happy path. Edge Caching: Measurements taken once are anecdotes; you need a baseline that repeats. Edge Caching: Costs usually concentrate in a small number of operations, so find those first.

Schema Migration: If the rollback plan needs a meeting, it is not a rollback plan. Schema Migration: Small pages that stay small are easier to keep fast than large ones made fast. Schema Migration: Write the invariant down; otherwise it lives only in someone's memory.

Data Pipelines: A queue smooths spikes but also hides how far behind you are. Data Pipelines: Retries without jitter turn a small outage into a large one. Data Pipelines: Separating the reads from the writes buys room to change either side.

Access Control: You can often replace a coordination problem with an idempotency key. Access Control: Anything that grows without a bound will eventually hit one. Access Control: Documentation that is not tested tends to describe the previous version.

A design that cannot be rolled back is a design that cannot be changed safely. The same reasoning holds for content delivery. For content delivery, the constraint matters more than the feature list. Latency budgets are easier to defend when every hop has a stated ceiling. Teams working on content delivery usually discover this the hard way. Caching helps only until the invalidation rules become the bottleneck.

Cost Controls: If a metric has no owner, it will drift until it causes an incident. Cost Controls: The cheapest optimisation is usually removing work nobody asked for. Cost Controls: Aggregating at write time trades flexibility for predictable read cost.

For crawl budget, the constraint matters more than the feature list. Periodic jobs should be safe to run twice, because they will be. Teams working on crawl budget usually discover this the hard way. You rarely need a new component to fix a boundary problem. The signal you want is often already logged, just not aggregated. This is most visible in crawl budget.

A design that cannot be rolled back is a design that cannot be changed safely. That applies to cost controls as well. In practice, cost controls behaves differently: Latency budgets are easier to defend when every hop has a stated ceiling. Caching helps only until the invalidation rules become the bottleneck. The same reasoning holds for cost controls.

Teams working on content delivery usually discover this the hard way. If the rollback plan needs a meeting, it is not a rollback plan. Small pages that stay small are easier to keep fast than large ones made fast. This is most visible in content delivery. Consider content delivery specifically. Write the invariant down; otherwise it lives only in someone's memory.

You can often replace a coordination problem with an idempotency key. That applies to observability as well. In practice, observability behaves differently: Anything that grows without a bound will eventually hit one. Documentation that is not tested tends to describe the previous version. The same reasoning holds for observability.

Backup Strategy: The first thing to settle is the failure mode, not the happy path. Backup Strategy: Measurements taken once are anecdotes; you need a baseline that repeats. Backup Strategy: Costs usually concentrate in a small number of operations, so find those first.

In practice, storage tiers behaves differently: A queue smooths spikes but also hides how far behind you are. Retries without jitter turn a small outage into a large one. The same reasoning holds for storage tiers. For storage tiers, the constraint matters more than the feature list. Separating the reads from the writes buys room to change either side.

Schema Markup: You can often replace a coordination problem with an idempotency key. Schema Markup: Anything that grows without a bound will eventually hit one. Schema Markup: Documentation that is not tested tends to describe the previous version.

Teams working on release process usually discover this the hard way. Serving static bytes is the cheapest thing you can do at the edge. A schema is an interface; changing it is a migration, not an edit. This is most visible in release process. Consider release process specifically. Track the denominator as carefully as the numerator.

Cloud Infrastructure: The interesting number is not the average, it is the 99th percentile. Cloud Infrastructure: Adding a cache in front of a slow query is a fix; fixing the query is a cure. Cloud Infrastructure: Every abstraction you add is a place where behaviour can differ from intent.

If the rollback plan needs a meeting, it is not a rollback plan. That applies to access control as well. In practice, access control behaves differently: Small pages that stay small are easier to keep fast than large ones made fast. Write the invariant down; otherwise it lives only in someone's memory. The same reasoning holds for access control.

In practice, release process behaves differently: Periodic jobs should be safe to run twice, because they will be. You rarely need a new component to fix a boundary problem. The same reasoning holds for release process. For release process, the constraint matters more than the feature list. The signal you want is often already logged, just not aggregated.

In practice, schema markup behaves differently: A queue smooths spikes but also hides how far behind you are. Retries without jitter turn a small outage into a large one. The same reasoning holds for schema markup. For schema markup, the constraint matters more than the feature list. Separating the reads from the writes buys room to change either side.

Consider cloud infrastructure specifically. The interesting number is not the average, it is the 99th percentile. Cloud Infrastructure: Adding a cache in front of a slow query is a fix; fixing the query is a cure. Every abstraction you add is a place where behaviour can differ from intent. That applies to cloud infrastructure as well.

In practice, schema migration behaves differently: If a metric has no owner, it will drift until it causes an incident. The cheapest optimisation is usually removing work nobody asked for. The same reasoning holds for schema migration. For schema migration, the constraint matters more than the feature list. Aggregating at write time trades flexibility for predictable read cost.