Golang implementation of Sliding Window Algorithm for local and distributed rate limiting.
It is a copy of the repository.
slidingwindow is an implementation of the scalable rate limiting algorithm used by Kong.
Suppose we have a limiter that permits 100 events per minute, and now the time comes at the "75s" point, then the internal windows will be as below:
In this situation, the limiter has permitted 12 events during the current window, which started 15 seconds ago, and 86 events during the entire previous window. Then the count approximation during the sliding window can be calculated like this:
count = 86 * ((60-15)/60) + 12
= 86 * 0.75 + 12
= 76.5 events
For details, see testutil.