Observability
The OTel Collector: receivers, processors, exporters, and deployment patterns
A new backend requirement lands: route traces to vendor-A, logs to vendor-B, and redact PII from both, starting next Monday. Without a Collector, that is three separate application deploys across 50 teams. With a Collector, it is one YAML change and one Collector restart.
Receivers, processors, exporters
The Collector is a YAML-configured pipeline with three stages:
Receivers accept incoming telemetry:
otlp— gRPC (port 4317) and HTTP (port 4318), the primary receiver for OTel-instrumented servicesfilelog— tails log files from the filesystem (useful for legacy apps that write to stdout/files)prometheus— scrapes/metricsendpoints (bridges Prometheus exporters into OTel)kafka— reads telemetry from Kafka topics- Vendor-specific receivers for non-OTel data
Processors transform records in-flight:
memory_limiter— drops new records when the Collector is above a RAM threshold; prevents OOM by designbatch— groups records into efficient batches (fewer network round trips to exporters)resource— adds service.name and other Resource attributes (e.g., injectdeployment.environment=production)attributes— redacts, renames, adds fields; used for PII scrubbing and Semantic Convention enforcementtail_sampling— keeps/drops traces based on the full trace context (errors, latency, business criteria) — covered in the next lessontransform— general-purpose transformations via OTTL (OpenTelemetry Transformation Language)k8sattributes— enriches spans/logs with Kubernetes pod, namespace, node, and deployment metadata
Exporters ship records to backends:
otlp— to another OTel-aware backend (another Collector, Grafana Tempo, Jaeger, etc.)datadog— vendor-specificprometheusremotewrite— to Prometheus or Grafana Mimirloki— to Grafana Loki for logs- Vendor-specific exporters for New Relic, Honeycomb, Splunk, Elastic, etc.
A minimal production-grade Collector YAML — one pipeline for traces:
receivers:
otlp:
protocols:
grpc:
endpoint: 0.0.0.0:4317
http:
endpoint: 0.0.0.0:4318
processors:
memory_limiter:
check_interval: 1s
limit_percentage: 80
spike_limit_percentage: 25
batch:
timeout: 10s
send_batch_size: 512
attributes:
actions:
- key: user.email
action: delete
exporters:
otlp/tempo:
endpoint: tempo:4317
tls:
insecure: true
service:
pipelines:
traces:
receivers: [otlp]
processors: [memory_limiter, batch, attributes]
exporters: [otlp/tempo]This accepts OTLP on 4317/4318, caps Collector RAM at 80% (drops new records before OOM), batches spans (10 s max wait, 512 max batch), redacts user.email from every span, and exports OTLP to a Tempo backend.
Three deployment patterns
Agent — a Collector runs as a sidecar (one per pod) or DaemonSet (one per node). Receives telemetry from the local application, does minimal processing (resource enrichment, batching), exports directly to the backend. Cheapest in network hops, hardest to run tail sampling (each agent sees only one node’s traffic).
Gateway — applications export directly to a central pool of Collector replicas that does heavy processing (tail sampling, redaction, multi-backend routing). Easier to scale processing centrally, but every span crosses the network from the app to the gateway.
Agent-to-gateway (the production-canonical pattern) — a DaemonSet agent on every node does minimal local processing and forwards via OTLP to a centralised gateway pool that handles tail sampling, redaction, and routing. The agent adds Kubernetes metadata (pod, namespace, node) via the k8sattributes processor before forwarding.
| Pattern | Agent location | Tail sampling possible? | Best for |
|---|---|---|---|
| Agent only | DaemonSet per node | No — each agent sees only one node | Simple setups, head sampling only |
| Gateway only | Central pool | Yes — sees all traffic | Small fleets, simple topologies |
| Agent-to-gateway | DaemonSet + central gateway | Yes — gateway sees full traces via sticky routing | Production Kubernetes, all sizes |
In the agent-to-gateway pattern, the agent’s loadbalancing exporter routes by trace_id hash to ensure all spans of a trace land on the same gateway replica — necessary for tail sampling, covered in the next lesson.
Why this works
Why does the Collector deserve to be a separate process from the application, even though the SDK could export to backends directly? Three reasons. (1) Buffering: when the backend slows or fails, the Collector buffers (in memory and on disk) so the application is not blocked. A direct SDK export would either drop telemetry (data loss) or back up into the application’s request handler (latency regression). (2) Policy: tail sampling, redaction, multi-backend routing belong outside application code — platform engineers update YAML without coordinating a redeploy across 50 teams. (3) Heterogeneous fleet: different services run different languages and SDK versions. The Collector normalises everything to OTLP and applies uniform policy regardless of upstream.
A team's OTel Collector is dropping spans during a traffic spike (otelcol_processor_dropped_spans is non-zero). Which processor is most likely engaging the drop?
Why is the agent-to-gateway pattern the production-canonical deployment for Kubernetes?
Order the Collector pipeline stages a span passes through in a standard trace pipeline:
- 1 OTLP receiver accepts the span batch from the application SDK
- 2 memory_limiter checks current RAM and drops if over threshold
- 3 k8sattributes adds pod, namespace, and node metadata
- 4 batch groups spans for efficient export
- 5 attributes redacts PII fields
- 6 OTLP exporter sends the batch to the backend
- 01What does the memory_limiter processor do and why must it come before other processors in the pipeline?
- 02Why does the agent-to-gateway pattern use a loadbalancing exporter on the agent tier instead of a simple round-robin?
- 03Name three processors and explain the production order they should appear in a traces pipeline.
The OTel Collector is a YAML-configured pipeline with three stages: receivers (otlp, filelog, prometheus, kafka) that accept incoming telemetry; processors (memory_limiter, batch, resource, attributes, k8sattributes, tail_sampling, transform) that transform records in-flight; and exporters (otlp, datadog, prometheusremotewrite, loki) that ship records to backends. memory_limiter must come first — it drops records cheaply before expensive processing when the Collector is under memory pressure. Three deployment patterns: agent (DaemonSet per node, simple, no tail sampling), gateway (central pool, tail sampling possible), and agent-to-gateway (the production-canonical Kubernetes pattern — DaemonSet agents enrich with Kubernetes metadata and forward via trace_id-hashed routing to a central gateway that runs tail sampling and multi-backend routing). The Collector’s value is decoupling policy (redaction, routing, sampling) from instrumentation (application code) — update YAML, not code.
- 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 in202
- Federation and lookahead: batching beyond DataLoadermiddle
- Senior GraphQL API: scheduling contract, tenant isolation, observabilitysenior
- 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
- Invalidation, dirty bits, and containmiddle
- Compositor layers: promotion, overlap, and GPU memorymiddle
- Production observability: LoAF, INP, and the full attack surfacesenior
- Hidden classes, transition trees, and memory layoutmiddle
- V8 in production: isolates, pointer compression, and real failuressenior
- What workers are and why they existjunior
- Web worker mechanics: dedicated, shared, and OffscreenCanvasmiddle
- Structured clone and transferablesmiddle
- SharedArrayBuffer, Atomics, and cross-origin isolationsenior
- Worker pools, Comlink, and production observabilitysenior
- 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
- Lock and single-flight: bounding concurrent rebuildsmiddle
- Stale-while-revalidate and CDN request coalescingmiddle
- Detecting stampedes and designing TTL for productionmiddle
- Metastable failure, fencing tokens, and production postmortemssenior
- What a relation is: tables, rows, keys, and constraintsjunior
- Constraints, keys, and Postgres data typesmiddle
- JSONB, arrays, and when a side table winsmiddle
- Schema integrity: deferral, versioning, and production failure modessenior
- 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
- Where data fetching happens — and why it decides LCPjunior
- React Server Components and Suspense streamingmiddle
- Senior internals: RSC payload, caching layers, and production failure modessenior
- Bits on the wirejunior
- Latency mathmiddle
- Bufferbloat and congestionsenior
- The physical frontiersenior
- The IP envelopejunior
- Reading the IP headermiddle
- Sequence numbers and connection statemiddle
- Flow control and congestion controlmiddle
- BBR, production observability, and beyond TCPsenior
- What TLS does and why it existsjunior
- Key schedule, SNI, ALPN, and extensionssenior
- 0-RTT defenses, ECH, hybrid PQ, and production TLSsenior
- 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
- At-most-once, at-least-once, exactly-once: the three delivery contractsjunior
- Consumer-side dedup: the cheapest path to exactly-once processingmiddle
- Exactly-once in production: impossibility proof, hybrid patterns, and real incidentssenior
- What OAuth is and why passwords are not the answerjunior
- Authorization code flow with PKCEmiddle
- Sender-constrained tokens: DPoP and mTLSsenior
- OAuth in production: audience attacks, observability, and real failuressenior