Observability
Sampling strategies: head, tail, and parent-based
At 10k requests per second, recording 100% of traces fills a backend in hours and generates a five-figure monthly bill. But if you drop 99% of traces, you lose exactly the errors and slow requests you need for debugging. Sampling is the tradeoff between cost and fidelity.
Head sampling: decide early, cheaply
The SDK’s Sampler runs on the very first span of a trace (the root span) and decides whether to record the trace. The decision is propagated to downstream services via the W3C traceparent header’s sampled flag.
AlwaysOn — records every trace. Full fidelity, maximum cost.
AlwaysOff — records nothing. Useful for a canary or a service under load test.
TraceIdRatioBased(p) — records a random p-fraction based on a hash of the trace_id. Deterministic across services: if two services both use TraceIdRatioBased(0.1), they independently make the same decision for the same trace because the hash is of the trace_id, which is shared across the request. At p=0.1, 10% of traces are recorded.
ParentBased — defers to the parent span’s sampling decision (via traceparent.sampled). When an upstream service decides to sample, all downstream services follow. When upstream does not sample, downstream typically does not, unless the local sampler overrides. Prevents inconsistent partial traces.
Production combination: ParentBased(root=TraceIdRatioBased(0.2)). The root span samples 20% of traces. All downstream spans inherit the decision. The result: either the full trace is recorded or nothing is — no partial traces with orphaned child spans.
Tail sampling: decide late, expensively
Tail sampling runs in the Collector after all spans of a trace have arrived and the trace is complete (or close enough). It can examine the full trace context: final status code, total latency, presence of error spans anywhere in the tree, business attributes on any span.
Typical tail sampling policies:
status_code=ERROR— keep 100% of traces with any ERROR spanlatency > 1000ms— keep 100% of slow tracesprobabilistic 1%— keep 1% of everything else as a baseline
The combination covers all interesting traffic (errors, slowness) and provides a cost-bounded baseline for normal traffic.
| Approach | Decision time | Can see errors? | Cost | Stateful? |
|---|---|---|---|---|
| Head (TraceIdRatioBased) | At root span start | No — decides before error happens | Low (SDK, <1 μs) | No |
| Tail (Collector processor) | After trace complete | Yes — sees full trace context | High (buffers spans in RAM) | Yes — must see all spans |
| ParentBased head | At each span start | No — same limitation as head | Low | No |
The sticky-routing constraint
Tail sampling requires that every span of a trace arrive at the same Collector gateway instance. If spans of one trace land on two different instances, neither can evaluate the full trace context and the sampling decision is wrong.
The OTel Collector’s loadbalancing exporter on the agent tier solves this: it hashes by trace_id and routes deterministically to the same gateway pod for all spans of a trace.
Tradeoff: the gateway becomes stateful. A pod restart or scale-up event reshuffles the hash ring and loses in-flight traces. Production mitigations:
- Pre-warm new pods before they enter the load-balancing ring
- Use conservative scaling policies (avoid frequent scale-up/down during traffic peaks)
- Size the gateway’s
num_tracesbuffer for peak rate ×decision_wait× safety factor (~2x)
Numbers
- Tail sampling buffer: ~1-2 GB per 50k active traces (100 spans each at ~1 KB/span)
- decision_wait: 30-60 seconds (must exceed p99 trace duration)
- num_traces: size for
peak_rate × decision_wait × 2— at 2,000 traces/sec and 30s window: ~120k - Head sampling baseline: 10-20% in production
- Tail sampling keeps: 100% errors + 100% slow (threshold 1s) + 1-5% baseline
- Net retained: ~3-5% of total traffic, 100% of interesting traffic
Why this works
Why not tail sample 100% without head sampling? Because tail sampling buffers every span in RAM until the decision_wait window closes. At 10k RPS × 50 spans per request × 30s window, that is 15 million spans in memory — several GB. Head sampling reduces the in-flight buffer proportionally. At 20% head + tail-curated, the buffer is 20% of the full volume, and all errors and slow tails are preserved because the tail sampler always overrides to keep. The combination gives you cost control (head) and fidelity (tail) with a bounded and predictable memory footprint.
Why is ParentBased(TraceIdRatioBased(0.2)) the standard head-sampler combination for distributed systems?
Tail sampling on the gateway requires all spans of a trace to land on the same Collector instance. What mechanism ensures this in the agent-to-gateway pattern?
Order the events in tail sampling from span creation to keep/drop decision:
- 1 Application emits spans to the agent Collector
- 2 Agent's loadbalancing exporter hashes trace_id, routes to deterministic gateway replica
- 3 Gateway buffers spans in the tail_sampling processor (num_traces buffer, in RAM)
- 4 After decision_wait (30-60s), the full trace context is evaluated
- 5 Policy check: ERROR status? Latency over 1s? Probabilistic baseline?
- 6 Keep or drop — kept traces are forwarded to the exporter; dropped are discarded
- 01What is the key difference between head sampling and tail sampling, and when does each fail?
- 02Why must tail sampling use sticky routing by trace_id, and what breaks if spans of one trace land on two gateway replicas?
- 03How do you size the tail_sampling buffer (num_traces), and what happens if you under-size it?
Sampling is the tradeoff between cost and fidelity. Head sampling (TraceIdRatioBased, AlwaysOn, ParentBased) decides at the root span start — cheap (<1 μs), stateless, but blind to errors and latency. ParentBased ensures all spans of a trace follow the root’s decision, preventing partial traces. Tail sampling in the Collector decides after the full trace arrives — it can keep 100% of ERROR traces and all traces over 1s latency, plus 1% baseline. It requires a stateful in-memory buffer (size for peak_rate × 30s × 2 safety factor, typically 1-2 GB per 50k active traces) and sticky trace_id routing via the loadbalancing exporter. Production pattern: ParentBased(TraceIdRatioBased(0.2)) at the SDK reduces the buffer volume by 80%, while the tail sampler preserves all interesting traffic. Net result: ~3-5% of total volume retained, 100% of interesting traces captured.
- Vendor neutrality, eBPF instrumentation, the Operator, and browser/serverless OTelsenior
- Operating the OTel Collector: reliability, version skew, failure modes, and governancesenior
- OTel: build a vendor-neutral pipelinesenior
- OTel: multiple-choice reviewsenior
- OTel: config and trace readingsenior
- OTel: free-recall reviewsenior
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