C10k problem

From Wikipedia, the free encyclopedia
Jump to: navigation, search

The C10k problem is the problem of optimising network sockets to handle a large number of clients at the same time.[1] The name C10k is a numeronym for concurrently handling ten thousand connections.[2] Note that concurrent connections are not the same as requests per second, though they are similar: handling many requests per second requires high throughput (processing them quickly), while high number of concurrent connections requires efficient scheduling of connections.

The problem of socket server optimisation has been studied because a number of factors must be considered to allow a web server to support many clients. This can involve a combination of operating system constraints and web server software limitations. According to the scope of services to be made available and the capabilities of the operating system as well as hardware considerations such as multi-processing capabilities, a multi-threading model or a single threading model can be preferred. Concurrently with this aspect, which involves considerations regarding memory management (usually operating system related), strategies implied relate to the very diverse aspects of the I/O management.[2]

History[edit]

The term was coined in 1999 by Dan Kegel, citing the Simtel FTP host, cdrom.com, serving 10,000 clients at once over 1 Gigabit Ethernet in that year.[1] The term has since been used for the general issue of large number of clients, with similar numeronyms for larger number of connections, most recently C10M in the 2010s.

By the early 2010s millions of connections on a single commodity 1U server became possible: over 2 million connections (WhatsApp, 24 cores, using Erlang on FreeBSD),[3][4] 10–12 million connections (MigratoryData, 12 cores, using Java on Linux)[5][6] 20 million requests per second (Haskell, 40+ cores).[7]

Common applications of very high number of connections include pub/sub servers, chat, file servers, web servers, and software-defined networking.[citation needed]

See also[edit]

References[edit]

  1. ^ a b "The C10K problem". Archived from the original on 2013-07-28. 
  2. ^ a b Liu, D.; Deters, R. (2009). "The Reverse C10K Problem for Server-Side Mashups". Service-Oriented Computing – ICSOC 2008 Workshops. Lecture Notes in Computer Science 5472. p. 166. doi:10.1007/978-3-642-01247-1_16. ISBN 978-3-642-01246-4.  edit
  3. ^ 1 million is so 2011
  4. ^ Scaling to Millions of Simultaneous Connections, Rick Reed, WhatsApp
  5. ^ How MigratoryData solved the C10M problem: 10 Million Concurrent Connections on a Single Commodity Server
  6. ^ Scaling to 12 Million Concurrent Connections: How MigratoryData Did It
  7. ^ Mio: A High-Performance Multicore IO Manager for GHC.