My problem is that I do not know how to form a reasonable expectation of the number of simultaneous connections. Presumably, at some point it is better to refuse new connections than to allow everything to slow down, because there are too many service requests.
Realistic workloads are hard to model, so I'm looking for a formula already explored by someone else.
(The obvious upper bound is the maximum heap size divided by the minimum amount of memory needed to service the request, but even this is difficult to measure in an garbage collector environment.)
hsivonen
source share