Observability
Iceberg SLIs, composite SLO math, and SLA vs SLO
A checkout service has a 99.9% availability SLO and it’s green. Customers are reporting duplicate charges. The SLO is not wrong — it’s measuring the wrong thing.
SLI selection: the iceberg failures
The SLI that breaks teams is the one that fails to correlate with user pain. The classic mistake: define an availability SLI on 5xx responses only. What this misses:
4xx-due-to-internal-bug: A 422 thrown because of a serialization error in the service returns a client-error code — not counted as a server failure, not counted as an SLO violation. The user’s request failed. The SLO is green.
High-latency-but-success: A request that took 30 seconds but returned 200 OK passes the availability SLI. The user experienced a failure (30s is above any reasonable latency threshold). If there’s no latency SLO, the SLO system misses it entirely.
Correctness errors: A charge confirmed for the user but missing from the backend. A search result that returned 200 with stale data from three hours ago. The HTTP status was fine; the data was wrong. The SLI didn’t measure it.
Missing events: A messaging service that drops 0.1% of notifications silently — no error, no timeout, just no delivery. The SLI on the send endpoint shows 100% success. The user’s message never arrived.
The senior pattern: SLI selection starts with “what is a bad outcome for the user?” then derives the measurement.
For a checkout service, bad outcomes:
- Charge failure: → availability SLI on payment endpoint
- Charge too slow: → latency SLI (99th percentile under 3s)
- Charge confirmed but missing in backend: → correctness SLI (confirmed_charges_matched / confirmed_charges_total, from a background reconciliation)
- Duplicate charge: → uniqueness SLI (distinct charge IDs / total charges attempted)
Multiple SLIs per journey is normal. The SLO platform aggregates them with worst-of joins: the journey SLO is breached if any of the SLIs violates its target.
Why this works
A duplicate charge returning 2xx passes the availability SLI — the service was “available.” The correctness failure is invisible to availability-only monitoring. This is the iceberg: availability is the visible 10%, correctness and freshness are the 90% below the waterline. Teams that have shipped a 99.9% availability SLO and still had a P0 correctness incident every quarter are typically running iceberg SLIs.
Composite SLO math
A user journey through N independent services has a ceiling:
journey_slo = ∏(S₁, S₂, ..., Sₙ)With independent failures, each service must succeed for the journey to succeed. Five services at 99.9% each: 0.999⁵ ≈ 0.995 — a journey ceiling of 99.5%, not 99.9%.
With dependent failures, the ceiling is lower. Shared database, noisy neighbour, regional network event: when a regional dependency degrades, all five services can fail simultaneously. The independence assumption fails, and ∏Sᵢ is an optimistic upper bound. The actual journey availability in a correlated failure event is worse than the math predicts.
Two architectural levers to raise the ceiling:
Parallel hedging: Fire two requests to two replicas, take the first that succeeds. The probability that both fail: (1 - S)². At 99.9% per replica: 0.001² = 0.000001 — journey availability jumps to 99.9999%. Cost: double traffic, double backend load, must handle the “extra” response (cancel it or deduplicate). Suitable for read-heavy paths where doubling traffic is acceptable.
Idempotent retries with backoff: On transient failure, retry with exponential backoff. A single retry converts most transient failures into successes. At 99.9% per attempt, one retry gives: 1 - (0.001)² ≈ 99.9999%. Cost: latency (the retry adds at least one round-trip’s delay). The endpoint must be idempotent — retrying a charge cannot create a duplicate charge. Idempotency keys (a client-generated unique ID per attempt) enforce this.
Turning architecture into SLO arithmetic: “Should we add a retry?” becomes measurable. If the current failure rate on the payment call is 0.05%, one retry reduces it to (0.0005)² ≈ 0.000025% — below any threshold. The budget gain in failure reductions per month can be calculated and compared to the latency cost in P99 terms.
| Approach | Single-service SLO | Journey ceiling | Cost |
|---|---|---|---|
| 5 services in series, no mitigation | 99.9% each | ~99.5% | None |
| Idempotent retries on critical path | 99.9% per attempt | >99.99% | Added latency on retry paths |
| Parallel hedging on one service | 99.9% per replica | >99.99% | 2× traffic to that service |
| Reduce journey to 3 services | 99.9% each | ~99.7% | Architectural refactor |
Latency SLOs and the happiness threshold
A latency SLO needs a threshold — how slow is “slow enough to count as a failure”?
Perceptual boundaries from UX research:
- 100ms: perceptual limit for “instant” — below this, the UI feels responsive
- 200ms: upper boundary of perceived immediacy for interactive elements
- 1s: threshold above which users notice a delay
- 3s: threshold above which a meaningful fraction of users abandon a web request
- 10s+: effectively a timeout for interactive use cases
For a request-driven API serving a UI: 200ms is the standard latency SLO threshold. For backend API calls between services: 1s is common. For batch jobs: minutes to hours depending on business context.
Multi-threshold SLOs catch tail-latency hiding behind a single percentile. “99% under 500ms” might pass while a degraded long tail fails “90% under 100ms.” Production-grade pattern: define both thresholds, AND them with worst-of logic. A service passes its latency SLO only if both thresholds hold.
SLA vs SLO: do not confuse them
The correct relationship: SLO_internal > SLA_external (stricter target internally).
Typical pattern:
- Customer SLA: 99.9% availability
- Internal SLO: 99.95% availability
- Buffer: 0.05 percentage points
The buffer absorbs incidents: when the internal SLO burns, the team investigates and fixes before the SLA breach threshold. The error budget policy kicks in at the SLO, not the SLA. Customers never see the internal SLO — they see whether the SLA was met, which it nearly always is because the team responded to the tighter internal target.
Setting SLO == SLA is the rookie trap. Every internal incident becomes a contract-breach risk. The error budget for SLO enforcement overlaps exactly with the error budget for legal exposure. There’s no buffer to absorb normal operational noise (deployments, dependency degradations, maintenance).
The buffer size depends on the service’s typical incident response time and the support structure. 0.05–0.5 percentage points is the common range. For a service with a 4-hour mean time to detect + respond, 0.5pp buffer gives the team room to find and fix before the SLA breaches. For a service with 2-minute automated rollback, 0.05pp buffer may suffice.
A team's user-journey checkout SLI counts a request as 'good' if it returns 2xx. After a release, customers report charges happening twice — but no SLO burn shows. What is wrong with the SLI?
An internal SLO is set at 99.9%, equal to the customer SLA. Why is this a problem?
- 01Name three failure modes that a 2xx-only availability SLI misses for a checkout service.
- 02Explain how idempotent retries improve composite SLO math and what architectural prerequisite they require.
- 03What is the correct relationship between SLA and SLO, and why should SLO be tighter?
SLI design must start from user-facing bad outcomes, not HTTP status codes. A 2xx-only availability SLI misses correctness errors, 4xx-due-to-internal-bugs, high-latency successes, and silent drops — the iceberg below the waterline. Multiple SLIs per journey (availability + latency + correctness) aggregated with worst-of logic is the production pattern. Composite SLO math multiplies: N services in series at 99.9% gives a 0.999^N ceiling. Idempotent retries and parallel hedging are the main architectural levers to raise the ceiling, each with a defined cost. SLA is a customer contract with financial penalties; SLO is an internal target. Setting SLO tighter than SLA by 0.05–0.5pp creates the buffer that lets the team respond before legal exposure begins. SLO == SLA is the rookie trap.
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