If you assume that queue is bounded (which is true for real systems), then Little's Law does hold: Number of requests in queue = latency * throughput E.g., le

If you assume that queue is bounded (which is true for real systems), then Little's Law does hold: Number of requests in queue = latency * throughput E.g., left hand side is a constant if you assume the system is fully utilized or constantly under max load.