This article explains the C10K problem and provides practical, non‑blocking and reactive strategies, thread‑count minimization, Netty configuration, memory management, and emerging technologies like GraalVM Native‑Image and Project Loom to keep Java servers stable under massive concurrent connections.
This article explains the C10K problem—how a single server can manage ten thousand simultaneous connections—and outlines four essential techniques (I/O multiplexing, asynchronous non‑blocking I/O, lightweight threading models, and network stack optimization) that enable Nginx and similar servers to achieve high concurrency efficiently.
This article explains the historic C10K problem of handling ten thousand concurrent connections, compares traditional BIO with modern I/O models such as NIO, select, poll, epoll, and AIO, and provides Java and C++ code examples illustrating how each model improves scalability and performance.
This article walks through the evolution of Java I/O models—from blocking BIO to non‑blocking NIO and multiplexed epoll—explains core concepts such as blocking, non‑blocking, synchronous and asynchronous operations, and demonstrates practical code for handling thousands of concurrent connections efficiently.
This article details a large‑scale C10K performance test of Dubbo, analyzes why service calls time out under thousands of concurrent consumers, identifies heartbeat‑induced Netty thread saturation and TCP full‑connection‑queue overflow as root causes, and presents concrete optimizations that dramatically improve latency and stability.
This article analyzes the C10K scenario where Dubbo‑based services experience massive timeout failures, examines root causes such as heartbeat‑induced Netty thread saturation and TCP backlog overflow, and presents a series of optimizations that dramatically improve latency, CPU usage, and stability in large‑scale deployments.
This article examines the classic C10K problem, explores its evolution to the C10M challenge, and analytically derives the theoretical maximum concurrent connections for servers and clients using five‑tuple calculations, port‑IP combinations, and NAT constraints, while highlighting practical limits and performance considerations.
This article explains how Netty achieves high‑performance, scalable networking by addressing the C10K and C10M problems through efficient I/O models, multithreading, zero‑copy ByteBuf handling, memory allocation strategies, and resource management techniques, providing practical code examples and architectural diagrams.
This article examines the theoretical and practical limits of concurrent TCP connections on a single Linux server, covering the historic C10K problem, file‑descriptor and port constraints, the 4‑tuple identification, and real‑world factors such as memory and bandwidth that cap achievable connections.
This article thoroughly examines Linux's epoll mechanism, detailing its SLAB memory management, middle‑layer design, edge and level triggering, comparison with select/poll, and related advanced polling technologies such as /dev/poll and kqueue, while also discussing C10K/C10M challenges and practical solutions.
This article reviews the historical C10K challenge, explains IO model improvements like epoll, kqueue and IOCP, and details practical Linux performance optimizations such as CPU and memory affinity, RSS/RPS/RFS/XPS, IRQ handling, kernel tuning, and hardware utilization for high‑concurrency servers.
This article humorously recounts the “80‑port war” between Apache and Nginx, using a comic strip to compare the legacy server’s extensive module list and age with Nginx’s event‑driven performance, C10K handling, and modern extensions, ultimately asking which will dominate the web.
