The Reverse C10K Problem for Server-Side Mashups

摘要: The original C10K problem [1] studies how to provide reasonable service 10,000 simultaneous clients or HTTP requests using a normal web server. We call the following reverse problem, RC10K -- support outbound running on can be found in scenarios like orchestrations and server-side mashups. A mashup needs send several partner services for each inbound request. Many approaches improving performance scalability of servers applied tackle problem. However, whether these verified. In this paper, we discuss mashups, propose design that takes advantage advanced I/O, multithreading, event-driven programming. results analysis experiments show our reduce resource requirements by almost one order magnitude with same provided, it is promising