The ticket admission flow control POC makes use of a data structure that stores samples of the total number of operations applied since startup and the total number of IX lock acquisitions since start up at a point in time corresponding to a specific timestamp.

It is risky to keep around an in-memory structure that grows in size proportionally to replication lag. This structure should be modified to be of fixed size. For now, the initial fixed size will be ~50 megabytes worth of data, but this size is subject to change and will perhaps be parametrized. Since the oldest entries (entries at the the majority point) are the most valuable information in the structure, it's preferable for the newest samples to lose resolution when the data structure hits its memory limits. Refactor the existing structure to use a deque.

This approximation does pose the risk of lag not being able to be adequately throttled in certain scenarios.