Roman Gershman
Roman Gershman
Yes, we have plans. Pls dm me at discord or send me an email - I would like to understand your use case better before prioritizing this task.
I am not talking about a reproducible test, I am talking about your system in general. Why do you use memcache in 2022 when writing a new code and cetera.
Ok, so it's actually an interesting use-case for us and this is why I wanted to chat with you. You prefer talking here? Discord is faster...
ok, 1. what's the size of your memcached cluster? are you throughput constrained? memory bounded? what would be the decisive factor for you to switch to DF i.e. what's the...
Algorithms that might help: https://www.usenix.org/conference/atc18/presentation/gong https://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-get.cgi/2016/CS/CS-2016-01.pdf we should choose the simpler one, not necessarily the most sophisticated one.
after reading these paper I think it's better to start with HeavyKeeper. We even do not need to maintain a min-heap data structure because query complexity is not the issue...
@Super-long please join our Discord server https://discord.gg/HsPjXGVH85 and say hello. I will add you to our #dev channel.
Как серпом по яйцам?! Ok, it's indeed a nice module. Also, it has a reference to the algorithm it implements, so should not be very hard to implement.
For reference, here is the [blog post about the algorithm](https://brandur.org/rate-limiting) by the author of the module, here is the [wiki article](https://en.wikipedia.org/wiki/Generic_cell_rate_algorithm)
it's a rate limiting algorithm