A Rust hyper/tower service that implements load shedding with queuing & concurrency limiting based on latency.

It uses Little’s Law to intelligently shed load in order to maintain a target average latency. It achieves this by placing a queue in front of the service it wraps, the size of which is determined by measuring the average latency of calls to the inner service. Additionally, it controls the number of concurrent requests to the inner service, in order to achieve the maximum p…