Networking & Protocols
WebSocket in production: proxies, security, and distributed architecture
You deploy your WebSocket server. Everything works in testing. In production, connections randomly drop after 60 seconds of silence, browsers report 1006s during idle periods, and your load balancer occasionally returns 502 on the upgrade. None of these are bugs in your application. They are proxy misconfigurations that are invisible until you know where to look.
Proxy and load-balancer misconfigurations
Proxies like Nginx, HAProxy, and AWS ALB were designed for HTTP — short-lived request-response conversations measured in milliseconds. A persistent WebSocket connection is alien to them. Common misconfigurations:
Problem 1 — Idle timeout closes quiet connections.
- Nginx default:
proxy_read_timeout 60s(closes if no data in 60 seconds). - AWS ALB default:
idle_timeout.timeout_seconds = 60. - Fix: raise to at least 3,600 seconds (1 hour).
location /ws {
proxy_pass http://backend;
proxy_http_version 1.1;
proxy_set_header Upgrade $http_upgrade;
proxy_set_header Connection "Upgrade";
proxy_read_timeout 3600s;
proxy_send_timeout 3600s;
proxy_buffering off;
}Problem 2 — L7 buffering delays the 101 response.
Nginx buffers HTTP responses by default. The 101 Switching Protocols response is held in the buffer until it is “complete” — but a WebSocket never completes its response. This can delay the upgrade by hundreds of milliseconds. Fix: proxy_buffering off.
Problem 3 — Proxy doesn’t understand the Upgrade header.
Some proxies strip or ignore Connection: Upgrade headers. The backend sees the request without Upgrade headers and returns a regular HTTP response instead of 101. Fix: explicitly set both headers as shown above.
Problem 4 — HTTP/2 proxy doesn’t forward WebSocket upgrades. If the proxy is HTTP/2 but the backend is HTTP/1.1, the proxy may not know to handle WebSocket extended CONNECT. Fix: test WebSocket through the proxy stack explicitly during deployment, not just HTTP traffic.
- Nginx: raise read/send timeout
- proxy_read_timeout 3600s
- AWS ALB: raise idle timeout
- idle_timeout.timeout_seconds = 3600
- Nginx: disable response buffering
- proxy_buffering off
- Server ping interval to defeat proxy idle timers
- every 25–30 s
- ALB sticky session (for stateful WS servers)
- Enable target group stickiness
- Origin header check (server-side)
- Mandatory — block unauthorized origins
Security: Origin checks, DoS, and slow-reader attacks
Origin check. The browser always sends an Origin header on WebSocket upgrades. The server must validate it:
if request.headers["Origin"] not in ALLOWED_ORIGINS:
respond 403 Forbidden
returnA WebSocket client outside the browser does not send an Origin header by default — if your server requires it, non-browser clients must add it. This is the primary defense against cross-site WebSocket hijacking (CSWSH), where a malicious page on attacker.com opens a WebSocket to api.yoursite.com using the victim’s cookies.
Rate limiting at the handshake. Botnets can exhaust the TCP SYN backlog with connection attempts. Rate-limit at the load balancer: maximum connection attempts per IP per second (typically 5–20). Apply TCP SYN cookies at the OS level (net.ipv4.tcp_syncookies = 1).
Slow-reader (Slow Loris) attack. A malicious client completes the WebSocket handshake but never reads from its socket. The server’s send queue fills for that connection. Mitigation: close connections with no data activity within 30 seconds (no message sent or received, no pong reply to a ping).
Per-message size limits. A client sending a 100 MB message forces the server to buffer 100 MB per subscriber. Enforce a maximum message size (typically 64 KB–1 MB) and close the connection with code 1009 (“message too big”) if exceeded.
Horizontal scaling: pub/sub and sticky sessions
A single WebSocket server hits its scale ceiling at 500 k–2 M connections. Beyond that, you need multiple servers with a shared messaging backbone.
Pub/sub (Redis Streams or RabbitMQ). Each server subscribes to the relevant channel(s). When the application publishes a message, all subscribed servers broadcast it to their local connected clients:
User A (connected to Server 1) sends a chat message.
Server 1 publishes { roomId, message, msgId } to Redis stream "room:42".
Server 2 (also subscribed to "room:42") reads from the stream.
Server 2 broadcasts to its locally connected users in room 42.This decouples senders from receivers and allows horizontal scale without requiring all clients to be on the same server.
Sticky sessions. When a load balancer routes the same client to the same server across reconnects, in-flight state (unACK’d messages, partial subscriptions) is preserved without requiring full Redis replication. AWS ALB implements this as target group stickiness (1-hour cookie by default). The downside: server failures send all sticky clients to reconnect to other servers simultaneously — a mini thundering herd per failed instance.
Why this works
Why the hardest part is not WebSocket but state management. The WebSocket protocol is straightforward. The hard engineering problem is: what happens when a user’s connection migrates to a different server during a horizontal scale event, a deploy, or a server failure? All the in-flight state — subscriptions, partial uploads, game sync position — must either live in a shared external store (Redis, database) or be re-established from scratch via the reconnect + message-resumption protocol. Discord, Slack, and all chat-scale services spend more engineering time on state replication and consistency under failures than on the WebSocket plumbing.
Observability: metrics you must export
A WebSocket service without these metrics will OOM silently:
| Metric | Target |
|---|---|
| Active connection count | Alert if grows without bound (connection leak) |
| Per-connection send-queue depth (p95/p99) | Target < 5 messages |
| Total queued bytes | Target < 5% of heap |
| Slow-client count | Target < 0.1% of connections |
| Message latency p99 | Target < 100 ms (end-to-end) |
| Close-code distribution (1000/1006/1013) | Spike in 1006 = network event |
| Reconnection rate per minute | Spike = server restart or outage |
Tools: netstat -an / ss -s for socket state counts, tcpdump for packet-level traces, Prometheus for application metrics, eBPF programs for socket buffer sizes and retransmit rates.
A financial trading platform needs to push 1000 price updates per second to 50k browsers in different geographies (US, Europe, Asia; RTT 10–300 ms). Which architecture is correct?
Design a chat application for 1 million concurrent users across US, EU, and APAC. Requirements: message delivery guarantee (at-least-once, no duplicates), reconnection with message history sync, p99 latency < 200 ms for cross-region messages, graceful degradation if one region goes offline. Stack: Redis Streams, PostgreSQL, CDN with edge compute.
- Latency p99 < 200 ms even for cross-region messages.
- No message loss (at-least-once delivery).
- No duplicates even when clients reconnect.
- Support 1M concurrent connections.
- Graceful degradation if a region goes offline.
- Redis Streams provide persistent ordered message storage with IDs for deduplication.
- Regional edge servers colocate clients with a local WebSocket server — avoiding cross-ocean RTT.
- Message IDs + last-seen tracking enable loss-free reconnection without full history replay.
- Evicting slow clients (queue depth threshold) prevents backpressure cascade.
- Replication lag is the cross-region metric that matters at scale — monitor and alert on it.
- Client library must implement jittered exponential backoff on every reconnect.
- 01Name three common Nginx misconfigurations that break long-lived WebSocket connections, and the fix for each.
- 02What is cross-site WebSocket hijacking (CSWSH) and how does the Origin header check defend against it?
- 03Why is pub/sub (e.g., Redis Streams) necessary for horizontal WebSocket scaling, and what is the role of sticky sessions alongside it?
Production WebSocket deployments fail most often not from the protocol but from proxy misconfigurations: idle timeouts (default 60s) closing quiet connections, response buffering holding the 101 response indefinitely, and missing Upgrade headers being stripped. Fix by raising timeouts to 3600s, disabling buffering, and setting explicit Upgrade headers — and send a server-side ping every 25–30 seconds to reset proxy idle timers. Security requires: Origin header validation (defense against CSWSH), handshake-level rate limiting (botnet defense), per-connection slow-read timeout (Slow Loris defense), and per-message size limits. Horizontal scale beyond a single server requires a pub/sub backbone (Redis Streams, RabbitMQ) so messages from any server reach clients on any other server, plus sticky sessions to preserve per-connection in-flight state. The hardest engineering is state replication and consistency under server failures — not the WebSocket plumbing. Key observability targets: slow-client count below 0.1%, total queued bytes below 5% of heap, p99 message latency below 100 ms.
appears again in258
- Why GraphQL gets N+1junior
- DataLoader mechanics: tick-boundary batchingmiddle
- Batch function contracts: ordering, shapes, errorsmiddle
- Federation and lookahead: batching beyond DataLoadermiddle
- Query complexity defences: depth, cost, persisted queriesmiddle
- 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
- Why idempotency: making retries safejunior
- Server-side state machine: four states of an idempotency keymiddle
- Retry strategies: backoff, jitter, and thundering herdmiddle
- Outbox and inbox: effectively-once across the dual-write boundarymiddle
- Concurrency and cache architecture for idempotency at scalesenior
- Observability, production failures, and global-scale designsenior
- The event loop: one thread, three queuesjunior
- Tasks, microtasks, and scheduler.yield()middle
- Timer accuracy, throttling, and idle workmiddle
- Microtask starvation, Long Tasks, and LoAFsenior
- Node.js event loop: phases, nextTick, and loop lagsenior
- React, Vue, and INP observability in productionsenior
- The render pipeline: six stages from bytes to pixelsjunior
- Stage costs and the renderer process modelmiddle
- Invalidation, dirty bits, and containmiddle
- Compositor layers: promotion, overlap, and GPU memorymiddle
- DevTools flame strip and the frame lifecyclemiddle
- Layout thrash: forced synchronous layoutsenior
- BeginMainFrame, compositor-driven animations, and GPU memorysenior
- Production observability: LoAF, INP, and the full attack surfacesenior
- What V8 is and why performance varies 100×junior
- V8''''s four-tier JIT pipeline and profile-guided tieringmiddle
- Hidden classes, transition trees, and memory layoutmiddle
- Inline caches, IC states, and deoptimizationmiddle
- Orinoco GC: parallel scavenger, concurrent marking, and write barriersmiddle
- TurboFan''''s speculative engine and the deopt-loop trapsenior
- V8 in production: isolates, pointer compression, and real failuressenior
- Service worker lifecycle and cache strategiesmiddle
- Service worker edge cases: version skew, durability, and navigation trapssenior
- What the reconciler does: render vs commitjunior
- The fiber object and the double-buffer treemiddle
- Render phase purity and commit phase sub-stepsmiddle
- Reconciliation: diffing heuristics and the key trapmiddle
- Priority lanes, time-slicing, and useTransitionmiddle
- Bailout, memoisation, and tearingsenior
- React Profiler, the Compiler, 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
- Hydration mismatch: causes, detection, and the determinism rulesenior
- RSC, per-route strategy, and production observabilitysenior
- Core Web Vitals: what LCP, INP, and CLS measurejunior
- LCP: four phases, one dominant costmiddle
- INP: input delay, processing, presentationmiddle
- CLS: why layout shifts happen and how to stop themmiddle
- 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 is a cache stampede and why it makes things worsejunior
- Lock and single-flight: bounding concurrent rebuildsmiddle
- XFetch: coordination-free probabilistic early expirationmiddle
- 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
- Normal forms, denormalization, and why schemas stickmiddle
- JSONB, arrays, and when a side table winsmiddle
- Heap storage, TOAST, and column alignmentsenior
- Schema integrity: deferral, versioning, and production failure modessenior
- Relational vs document, wide-column, graph, and key-valuesenior
- 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
- MVCC: why readers and writers never wait for each otherjunior
- Row versions and snapshots: the on-disk mechanicsmiddle
- HOT updates and isolation levels: what you gain and what you paymiddle
- Vacuum and bloat: keeping the storage tax boundedmiddle
- CLOG, XID wraparound, and MultiXact: deep visibility internalssenior
- SSI internals and production autovacuum tuningsenior
- Real-world MVCC failures, deployment patterns, and distributed snapshotssenior
- 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
- What a schema migration is and why it replaces ad-hoc DDLjunior
- 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
- Expand-contract: zero-downtime for breaking schema changesmiddle
- Advisory locks, migration tools, and deploy coordinationsenior
- Migration failure taxonomy and production disciplinesenior
- Why sharding exists: the single-Postgres ceilingjunior
- Shard-key selection: hash, range, list, and directory strategiesmiddle
- Partitioning vs sharding: same word, two different thingsmiddle
- Co-location and Citus: the invariant that makes sharding usablemiddle
- The hot-shard failure mode: detection, isolation, and durable policymiddle
- Schema-based sharding and multi-tenancy alternativessenior
- 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
- Raft roles, terms, and why majority quorums prevent split brainjunior
- How Raft replicates a log entry and decides it is safe to commitmiddle
- Raft leader election: timeouts, voting rules, and the four safety propertiesmiddle
- Raft in the real world: partitions, slow disks, and client routingmiddle
- Raft extensions: pre-vote, learners, snapshots, and linearizable readssenior
- Raft in production: membership changes, Multi-Raft, and observabilitysenior
- Where data fetching happens — and why it decides LCPjunior
- Fetch waterfalls — diagnosis and the Promise.all curemiddle
- React Server Components and Suspense streamingmiddle
- Client-side cache: TanStack Query, SWR, and stale-while-revalidatemiddle
- LCP, prefetch, and race conditions in interactive fetchingmiddle
- Senior internals: RSC payload, caching layers, and production failure modessenior
- 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
- SLI, SLO, and the error budget: reliability by the numbersjunior
- 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
- Production SLO failures, self-observability, security, and the big picturesenior
- 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
- The incident loop: from pager to postmortem to preventionmiddle
- 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
- Cache lines, struct layout, and false sharingmiddle
- Branch prediction and branchless codemiddle
- SIMD, SoA vs AoS, and memory bandwidthmiddle
- Hardware prefetcher, TLB, and memory-level parallelismsenior
- Cache-oblivious algorithms, PGO, and production failuressenior
- 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
- The three failure legs — where duplicates and losses actually happenmiddle
- Consumer-side dedup: the cheapest path to exactly-once processingmiddle
- Kafka exactly-once semantics: idempotent producer and transactionsmiddle
- SQS visibility timeout, DLQ, and the outbox patternmiddle
- 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
- ID token validation and JWKS cache managementmiddle
- Refresh token rotation and scope-based least privilegemiddle
- Sender-constrained tokens: DPoP and mTLSsenior
- OAuth in production: audience attacks, observability, and real failuressenior