Observability
Cost discipline: keeping observability under 5% of infra spend
A 200-service engineering org sends you the observability bill: $680k/year, growing faster than traffic. The platform team has two quarters to cut it in half without losing debugging power. No new tooling. No vendor change. The difference between a well-tuned and an untuned org is not the backend — it is three levers and the discipline to apply them.
Why observability scales superlinearly without discipline
Production observability scales linearly with traffic for the baseline signal volume, but superlinearly with cardinality. One new unbounded label (e.g. user_id added to a metric) can multiply the metric series count by 10–100x overnight. Trace volume grows with request count. Log volume grows with request count and can spike on errors. Without governance, a 10x traffic increase can mean a 50–100x cost increase.
The industry benchmark for a well-tuned org: $1–5 per million requests for full four-signal observability. For an untuned org: $10–50 per million requests. The difference is engineering discipline, not vendor choice.
The three cost levers
Lever 1: Cardinality limits on metrics
Every unique combination of label values creates one time-series. A metric http_requests_total{service, route, status_code} with 200 services × 500 routes × 600 status codes = 60 million series. The realistic cardinality budget is 5–10k active series per service.
Rules that prevent cardinality explosions:
- Use route templates, not full URLs (
/users/{id}not/users/17384). - Use status classes, not exact codes (
2xx,4xx,5xxnot200,201,404). - Never use
user_id,request_id,email, or any unbounded value as a label. - Enforce limits in CI: a lint step rejects any new label whose values are unbounded.
Lever 2: Tail sampling on traces
Without tail sampling a 200-service org at 10k requests/second generates ~10k trace trees per second. Keeping all of them at 30-day retention is the biggest cost driver. Tail sampling policy:
- 100% of traces with any ERROR span.
- 100% of traces with total duration above the slow threshold (2 s typical).
- 5% random baseline of everything else.
Expected result: 80–90% trace volume reduction with zero debugging-power loss. Errors and slow traces are the only traces you ever navigate; the 5% baseline provides context for rate/pattern analysis.
Lever 3: Tiered retention on logs and profiles
Not all data needs to be queryable at full resolution forever.
| Tier | Retention | Cost level | Use case |
|---|---|---|---|
| Hot (full resolution) | 7–14 days | High | Incident investigation |
| Summary / rollup | 30–90 days | Medium | Trend analysis, SLO review |
| Archival (object storage) | 90 days–7 years | Low | Compliance, rare deep dives |
Logs in mature orgs: hot 14 days, summary 30 days, archival 90 days. Profiles: hot 30 days, downsampled 90 days. Tiered retention makes cost grow logarithmically with time rather than linearly.
| Signal | % of typical bill | Primary cost lever |
|---|---|---|
| Logs | ~40% | Tiered retention + log-level audit |
| Metrics | ~25% | Cardinality limits enforced in CI |
| Traces | ~25% | Tail sampling (80–90% volume drop) |
| Profiles | ~10% | Per-service sample rate (default 99 Hz) |
The cost-cutting playbook applied
Back to the $680k/year platform team asked to cut costs by 50% in two quarters.
Step 1: Pareto analysis. Pull the bill broken down by service and signal type. Top 5 services account for ~60% of cost. Top 1 signal type (usually logs) accounts for ~50% of cost.
Step 2: Logs at $300k/year. Look for: verbose log levels in production (INFO or DEBUG instead of WARN); error messages logged on every retry; per-request log lines that duplicate trace span events; repeated identical messages. Fixes: log-level audit, dedup, move per-request info into span attributes, rate-limit noisy events.
Step 3: Metrics at $200k. Find the top 20 metrics by series count. Most will have unbounded labels. Drop them via collector relabeling; route the dimension into traces or logs instead. Expected: 50–70% series reduction.
Step 4: Traces at $150k with no tail sampling. Deploy tail-sampling policy (errors 100% + slow 100% + 5% baseline). Expected: 80–90% trace volume reduction.
Step 5: Profiles at $30k. Leave them. Profiling is ~10% of total cost; cutting it saves little and destroys CPU debugging power. Better to turn it on for services that lack it — saves more by preventing future incidents.
Expected results: Logs −40% ($120k saved), metrics −50% ($100k saved), traces −85% ($127k saved). Total: $347k saved. Cost from $680k to $333k — 49% reduction in two quarters.
MTTD vs MTTR: both matter, MTTD is the bigger lever
Mean Time To Detect (MTTD): how long between something breaking and an alert firing. Multi-window burn-rate alerts (unit 05) drive MTTD to 1–5 minutes.
Mean Time To Resolve (MTTR): how long between alert and fix. Funnel discipline drives MTTR to 3–10 minutes.
A 30-second MTTD turns a 10-minute incident into a 5-minute one for users. A 5-minute MTTD turns the same incident into 15 minutes. MTTD compounds faster than MTTR because it affects every request sent during the failure window. Measure both separately; show both on the team reliability scorecard.
- Well-tuned org cost / million requests
- $1–5
- Untuned org cost / million requests
- $10–50
- Observability / total infra cost target
- 3–7%
- Cardinality budget per service
- 5–10k active series
- Trace volume reduction (tail sampling)
- 80–90%
- Typical MTTD with burn-rate alerts
- 1–5 minutes
- Typical MTTR with funnel discipline
- 3–10 minutes
A platform team is asked to cut observability cost by 30% without losing debugging power. Which set of moves is most likely to deliver?
A team adds a new metric: http_requests_total{service, user_id, endpoint}. The service handles 50k unique users and 200 endpoints. How many new time series does this create?
- 01Name the three primary cost levers and state what each one controls.
- 02Walk the cost-cutting playbook for a $680k/year observability spend that needs to reach $340k in two quarters.
- 03Why is MTTD often a bigger lever than MTTR for user-facing impact?
Production observability scales superlinearly with cardinality without discipline: one unbounded label can multiply a metric’s series count 100x overnight. The industry benchmark is $1–5/million requests for a well-tuned org versus $10–50 for an untuned one — a 10x difference driven by data discipline, not vendor choice. Three levers control the bill: cardinality limits enforced in CI (no unbounded labels, route templates not URLs), tail sampling that keeps 100% of errors and slow traces while discarding 90%+ of baseline volume, and tiered retention that moves data from hot storage to cheap object storage as it ages. The cost-cutting playbook runs Pareto first (top 5 services drive 60% of cost), then addresses logs (−40%), metrics (−50%), and traces (−85%) in descending cost order. Profiling at ~10% of total cost is the last thing to touch. MTTD from burn-rate alerting and MTTR from funnel discipline compound to keep most incidents under 10 minutes total for users.
appears again in167
- The journey of a request: seven stops from socket to responsejunior
- Accept and parse: from kernel queue to a typed requestmiddle
- Routing and middleware: choosing what runs, and in what ordermiddle
- Handler and response: from business logic to bytes on the wiremiddle
- Streaming and backpressure: when the client reads slower than you writesenior
- Timeouts and tail latency: budgets, deadlines, and the fan-out trapsenior
- Middleware and DI: the two patterns that shape every backendjunior
- Writing middleware: signatures, next(), and the three framework modelsmiddle
- Inversion of control: how dependencies reach a classmiddle
- DI scopes and lifecycles: singleton, request, transientmiddle
- DI as a testing seam: fakes, mocks, and the boundary that matterssenior
- DI containers in production: resolution graphs, circular deps, and when not tosenior
- Blocking vs non-blocking I/O: two ways to waitjunior
- The event loop: one thread, ordered phasesmiddle
- What blocks the loop: CPU work and sync callsmiddle
- Offloading CPU work: worker threads and the libuv poolmiddle
- Backpressure and bounded concurrencysenior
- Throughput under load: tail latency and saturationsenior
- Why pool: the cost of creating a connectionjunior
- Pool sizing: why bigger is not fastermiddle
- Acquisition and timeouts: the wait queue is the real latency dialmiddle
- Retry strategies: backoff, jitter, and thundering herdmiddle
- Observability, production failures, and global-scale designsenior
- Tasks, microtasks, and scheduler.yield()middle
- Timer accuracy, throttling, and idle workmiddle
- Node.js event loop: phases, nextTick, and loop lagsenior
- Rendering strategies: SSG, SSR, ISR, streaming, and hydrationjunior
- SSG, SSR, ISR, streaming, and RSC — how each worksmiddle
- Hydration cost: selective, progressive, islands, resumabilitymiddle
- Core Web Vitals: what LCP, INP, and CLS measurejunior
- LCP: four phases, one dominant costmiddle
- INP: input delay, processing, presentationmiddle
- Lab vs field: why the two disagree and how to use eachmiddle
- Metric tradeoffs, RUM attribution, and the CI+field loopsenior
- The full picture: URL to LCP to INP as a relay racejunior
- Eight layers traced: from the service worker to the second navigationmiddle
- Five canonical breaks: where production reliably diessenior
- The three-track method: reading traces and building a monitored systemsenior
- What an index is and how it speeds up queriesjunior
- The leading-column rule and composite index designmiddle
- Partial, expression, and covering indexesmiddle
- Index types: GIN, GiST, BRIN, Hash, Bloom, and HOT updatesmiddle
- Index-only scans, the Visibility Map, and INCLUDEsenior
- Production failure modes and the index audit playbooksenior
- Index design exercise: full-text search strategysenior
- EXPLAIN and execution plans: what the planner decides and whyjunior
- Scan types: Seq, Index, Bitmap, Index-Onlymiddle
- Join algorithms and the row-estimate cascademiddle
- pg_statistic, ANALYZE, and production observabilitymiddle
- Extended statistics: fixing correlated-column estimate failuressenior
- Plan cache, cost-constant tuning, and planner internalssenior
- Production failure modes and plan stabilitysenior
- Connection pools: amortising the cost of a Postgres backendjunior
- PgBouncer session, transaction, and statement modesmiddle
- Pool sizing: the (cores × 2) + spindles formula and the two-layer stackmiddle
- Pool exhaustion and idle-in-transaction: the 3 AM failure modemiddle
- Migrating to transaction mode: rollout playbook and PgBouncer 1.21 prepared statementsmiddle
- The Postgres process model and why raising max_connections degrades throughputsenior
- Pooler landscape 2026, serverless connection storms, and the full failure-mode taxonomysenior
- ADD COLUMN: instant in PG 11+ vs rewrite in older Postgresjunior
- The lock-queue failure mode: why instant DDL can freeze the databasemiddle
- Safe DDL patterns: NOT VALID, CONCURRENTLY, and unsafe-op fixesmiddle
- Migration failure taxonomy and production disciplinesenior
- Shard-key selection: hash, range, list, and directory strategiesmiddle
- Co-location and Citus: the invariant that makes sharding usablemiddle
- The hot-shard failure mode: detection, isolation, and durable policymiddle
- Online resharding, 2PC, and the operational cost of shardingsenior
- The seven acts: from CREATE TABLE to Citusjunior
- Acts 1–3 in depth: schema, indexes, and planner statisticsmiddle
- Acts 4–6 in depth: MVCC bloat, connection pooling, and safe migrationsmiddle
- Act 7 in depth: sharding, co-location, and the seven-tier tradeoff cascademiddle
- Observability, anti-patterns, and production triagesenior
- Bits on the wirejunior
- Latency mathmiddle
- Bufferbloat and congestionsenior
- The physical frontiersenior
- Sequence numbers and connection statemiddle
- Flow control and congestion controlmiddle
- BBR, production observability, and beyond TCPsenior
- CDN: putting content next doorjunior
- Anycast and GeoDNS: routing to the nearest edgemiddle
- Tiered cache and Cache-Controlmiddle
- Vary header and cache keysmiddle
- Stale-while-revalidate and cache stampedesenior
- Edge workers and edge-side compositionsenior
- CDN operations and observabilitysenior
- WebSocket: the HTTP upgrade handshakejunior
- WebSocket vs SSE vs long-polling: choosing the right transportmiddle
- WebSocket backpressure: when clients can''''t keep upmiddle
- Reconnection: jittered backoff, thundering herd, message resumptionsenior
- WebSocket at scale: HTTP/2 multiplexing, permessage-deflate, C10Msenior
- WebSocket in production: proxies, security, and distributed architecturesenior
- What reverse proxies dojunior
- Balancing algorithms: round-robin to power-of-two-choicesmiddle
- L4 vs L7 load balancing and client-IP preservationmiddle
- Health checks, connection draining, and slow startmiddle
- Retry storms, circuit breakers, and load sheddingsenior
- Resilient LB architecture: anycast, zone-aware routing, and observabilitysenior
- Why QUIC and not TCP+TLSjunior
- QUIC streams and head-of-line blockingjunior
- Integrated handshake and 1-RTTmiddle
- Connection IDs and network migrationmiddle
- Loss detection and congestion controlmiddle
- 0-RTT resumption and packet encryptionsenior
- Deployment tradeoffs and CPU costsenior
- DDoS: what it is and why it worksjunior
- Amplification attacks and state exhaustionmiddle
- Rate limiting: algorithms and architecturemiddle
- WAFs, firewalls, mTLS, and HSTSmiddle
- DNS cache poisoning and BGP hijackingsenior
- Defense-in-depth architecture and attack economicssenior
- The twelve layers: one URL, seven actorsjunior
- DNS, TCP, TLS in sequence: where the milliseconds gomiddle
- Critical render path and Core Web Vitalsmiddle
- Proxy intercepts and security gates: rate limiters, WAF, mTLSmiddle
- Alternate paths: QUIC 0-RTT, WebSocket upgrade, connection migrationmiddle
- Observability: distributed traces, USE/RED, and samplingsenior
- Resilience: cascading retries, circuit breakers, and error budgetssenior
- Why profile first: measure where time actually goesjunior
- Amdahl''''s law and self-time: the ceiling on every speedup you can shipmiddle
- The measurement loop: microbench, macrobench, prod profile, observer effectmiddle
- Reading flame graphs: shapes, per-language profilers, and the 60-second scanmiddle
- Statistical baselines: why one run is not a measurementmiddle
- Profiler history and microbenchmark pitfalls: Knuth to GWPsenior
- Hardware counters, cold-start profiles, and profile securitysenior
- Continuous profiling at scale: costs, CI gates, trace correlation, and anti-patternssenior
- What makes a hot path: symptom vs causejunior
- Five shapes of hotspot: CPU, alloc, cache, lock, syscallmiddle
- Reading parent and child chains: where to apply the fixmiddle
- JIT deopt, the fix-and-verify loop, and PR-time profilingmiddle
- Hardware counters and Intel TMA: sub-category diagnosissenior
- False sharing and native-bridge hot pathssenior
- Hot paths in production: security, tail latency, and tooling lineagesenior
- Memory hierarchy: why the same O(N) loop can be 17x slowerjunior
- Row-major vs column-major: access order and the 9x gapjunior
- Branch prediction and branchless codemiddle
- Hardware prefetcher, TLB, and memory-level parallelismsenior
- GC basics: what the runtime taxes you forjunior
- GC algorithms: generational, concurrent, and per-runtimemiddle
- GC tradeoffs: pause, throughput, heap — and object poolingmiddle
- GC tuning: pacing, heap shape, and allocation observabilitymiddle
- GC internals: tri-color invariant, write barriers, and per-runtime deep-divessenior
- GC in production: observability, security, edge cases, and fleet governancesenior
- N+1: one logical operation, many round-tripsjunior
- Fix families: JOIN, IN, preload, and DataLoadermiddle
- Detecting N+1: query logs, APM traces, and CI gatesmiddle
- DataLoader: batching across resolver treesmiddle
- Cross-protocol N+1: HTTP fan-out and Redis MGETmiddle
- N+1 at scale: pool exhaustion, plan changes, and denormalisationsenior
- Batching: amortize fixed cost per operationjunior
- The batching window: size and wait timemiddle
- Batching in Kafka and Postgresmiddle
- io_uring and observability of batchingmiddle
- From Nagle to io_uring: evolution of batchingmiddle
- Backpressure, failure isolation, and batch security in productionsenior
- What a bundle actually costs: download, parse, compile, executejunior
- Core Web Vitals: LCP, INP, and CLSmiddle
- Code splitting: route-level, component-level, vendor splittingmiddle
- Tree shaking and compression: removing what you don''''t usemiddle
- Third-party scripts: the silent budget killermiddle
- CI enforcement and RUM: making budgets stickmiddle
- V8 JIT pipeline, HTTP priorities, and bundle securitysenior
- The performance loop: discipline, not a projectjunior
- Classify and fix: matching bottleneck families to remediesmiddle
- Observability stack and CI gates: catching regressions before they shipmiddle
- Incident to enforcement: SLO burn to verified fix in 35 minutesmiddle
- Culture, economics, and org-scale performancesenior