Networking & Protocols
L4 vs L7 load balancing and client-IP preservation
Your service logs show every request coming from the same IP — the load balancer’s IP. You can’t rate-limit by client, can’t geo-block, can’t audit who did what. That is the price of not thinking carefully about which layer your load balancer operates at.
Layer 4: routing on IP and port
An L4 load balancer sees the TCP or UDP header only. It routes on the 4-tuple: source IP, source port, destination IP, destination port. It never reads the HTTP payload.
Mechanics:
- Sees a TCP SYN from the client.
- Picks a backend by the configured algorithm.
- Either rewrites the destination IP (NAT mode) or opens a new TCP connection to the backend (proxy mode).
- Forwards raw TCP segments in both directions.
Cost: ~1–5 µs per packet, <1% CPU. Throughput: 10–40 Gbps per server.
What L4 can do:
- Route any TCP/UDP protocol (PostgreSQL, Redis, MQTT, custom binary).
- Handle millions of connections per second.
- Terminate TCP independently of HTTP.
What L4 cannot do:
- Inspect or modify HTTP headers, path, or host.
- Retry on HTTP 5xx errors (it does not understand HTTP).
- Perform TLS termination without understanding the TLS record format.
- Route different
/api/v1/and/api/v2/paths to different backends.
Layer 7: routing on HTTP content
An L7 load balancer terminates the HTTP (and TLS) connection, parses the request, and applies routing rules before forwarding to a backend.
Mechanics:
- Terminates the client’s TLS — it sees the plaintext.
- Reads the HTTP method, path,
Hostheader, custom headers. - Applies routing rules (e.g.,
/api/→ pool A,/static/→ pool B). - Opens a new connection (or reuses a pool) to the chosen backend.
- Forwards the request (adding proxy headers like
X-Forwarded-For).
Cost: ~100–500 µs per request, 5–15% CPU. Throughput: 1–10 Gbps per server.
What L7 adds over L4:
- Content-aware routing: path, hostname, header, cookie.
- Retry on 5xx (understands HTTP semantics).
- Per-endpoint metrics, rate limiting, auth checks.
- TLS termination once at the LB edge instead of on every backend.
- Traffic splitting (10% → canary, 90% → stable).
- L4 hop latency
- 1–5 µs
- L7 hop latency
- 100–500 µs
- L4 throughput per server
- 10–40 Gbps
- L7 throughput per server
- 1–10 Gbps
- L4 CPU per packet
- <1%
- L7 CPU per request
- 5–15%
- L4 protocols
- any TCP/UDP
- L7 protocols
- HTTP, gRPC, WebSocket
Client-IP preservation
When the LB forwards a request to the backend, the backend sees the LB’s IP as the TCP source address — not the real client. Three standards exist to restore this:
X-Forwarded-For (XFF)
X-Forwarded-For: 203.0.113.195The LB appends the client IP to this header. HTTP-only. Trivially spoofed: a malicious client can send X-Forwarded-For: 1.2.3.4 and an unvalidated proxy appends rather than overwrites. Only the rightmost IP added by a trusted proxy is reliable.
RFC 7239 Forwarded header
Forwarded: for=203.0.113.195;proto=https;host=example.comStandardized (RFC 7239), structured format, harder to parse incorrectly. Includes protocol and host alongside the IP. Still HTTP-only but less prone to accidental misparse.
PROXY protocol (HAProxy)
A text or binary header prepended before the TLS/HTTP payload:
PROXY TCP4 203.0.113.195 93.184.216.34 35646 80\r\nWorks for any TCP/UDP protocol — no HTTP required. The backend TCP stack reads the header before any application-layer parsing. Harder to spoof than an HTTP header because it is inserted at the transport layer by a trusted proxy. Nginx, HAProxy, and Envoy all support PROXY protocol.
Which to choose: HTTP services behind trusted proxies → XFF or RFC 7239. Non-HTTP services (PostgreSQL, MQTT, custom binary) or where strict tamper-resistance matters → PROXY protocol.
Trace a request that switches from L4 to L7 as it moves through a two-tier LB architecture.
Which RFC standardizes the Forwarded header for preserving client IP through proxies?
Why this works
Why L4 + L7 in series? Many production architectures use an L4 LB at the network edge (BGP anycast, absorbs floods, handles millions of connections) and an L7 LB behind it (terminates TLS, applies routing policies, emits per-endpoint metrics). The L4 layer handles the raw packet pressure cheaply; the L7 layer adds intelligence without needing to scale to packet-rate throughput. AWS uses this two-tier pattern: Network Load Balancer (L4) → Application Load Balancer (L7).
You need to route /api/payments/ to a PCI-DSS-compliant backend pool and /api/catalog/ to a regular pool. Which load balancer layer can do this, and why?
- 01You want to route by HTTP path and retry on 5xx. Which LB layer is required, and what is its latency cost?
- 02Why is X-Forwarded-For spoofable, and how does PROXY protocol improve on it?
- 03When would you choose L4 over L7 even for HTTP traffic?
L4 load balancers route on the TCP/UDP 4-tuple — they are fast (1–5 µs, 10–40 Gbps) and protocol-agnostic but cannot inspect HTTP. L7 load balancers terminate TLS, parse HTTP, and enable path/host/header routing and 5xx retries — at the cost of 100–500 µs latency and 5–15% CPU. Both types hide the client’s IP from the backend; the three standards to restore it are X-Forwarded-For (de facto but spoofable), RFC 7239 Forwarded (structured, HTTP-only), and PROXY protocol (binary, any TCP/UDP, hardest to spoof). Production architectures often stack L4 at the edge and L7 behind it: raw packet throughput handled cheaply at L4, content intelligence at L7.
appears again in162
- 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
- What the three signals are: logs, metrics, and tracesjunior
- Metrics and cardinality: the cost model of a time-series databasemiddle
- Logs and volume: the cost model of structured loggingmiddle
- Traces and sampling: the cost model of distributed tracingmiddle
- Join keys and exemplars: making the three signals composemiddle
- Observability 2.0: wide events and the cost shiftsenior
- Failure modes and engineering practice: cardinality budgets, PII, and samplingsenior
- Why structured logs exist: the diary vs the spreadsheetjunior
- The production log schema: fields every line must carrymiddle
- Log levels and alert routingmiddle
- Sampling strategies and log costmiddle
- PII redaction and log injectionsenior
- Trace context propagation in logssenior
- OTel Logs Data Model and audit logs as a subsystemsenior
- OTel signals, Semantic Conventions, and the OTLP wire formatmiddle
- Auto-instrumentation and manual spans: the 80/20 of OTelmiddle
- The OTel Collector: receivers, processors, exporters, and deployment patternsmiddle
- Sampling strategies: head, tail, and parent-basedmiddle
- Vendor neutrality, eBPF instrumentation, the Operator, and browser/serverless OTelsenior
- Operating the OTel Collector: reliability, version skew, failure modes, and governancesenior
- RED and USE: two checklists, one triage disciplinejunior
- Instrumenting RED in Prometheus: counters, histograms, and cardinality disciplinemiddle
- USE on Linux: CPU, memory, disk, network, and PSImiddle
- Golden signals, dashboard layout, and service mesh auto-REDmiddle
- Cardinality as a cost driver: labels, PII, exemplars, and samplingmiddle
- Native histograms, SLO tie-in, and production failure patternsmiddle
- Choosing SLIs and SLO targets: ratios, not feelingsmiddle
- Multi-window multi-burn-rate alerting: why AND beats ORmiddle
- Error budget policy, latency SLOs, and composite journeysmiddle
- Iceberg SLIs, composite SLO math, and SLA vs SLOsenior
- Flame graphs: reading the picture that shows where time goesjunior
- Sampling vs instrumentation profiling: why 99 Hz wins in productionmiddle
- Profile types: CPU, memory, off-CPU, mutex — which one to reach formiddle
- Continuous profiling: always-on flame graphs with eBPF and trace-id correlationmiddle
- How flame graphs are built from samples, and the production workflows that use themmiddle
- Linux perf, eBPF internals, PGO, and the limits of samplingsenior
- Profiling in production: security, war stories, OTel profiles, and the infrastructure designsenior
- The debugging funnel: SLO → RED → trace → profilejunior
- OTel architecture: one SDK, four signals, one wire formatmiddle
- Cost discipline: keeping observability under 5% of infra spendmiddle
- Scale, security, and the ROI of observable systemssenior
- 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