Selection of A Suitable Algorithm for the Implementation of Rate-Limiter Based on Bucket4j

Abstract

In shared network services, rate limiting is essential as it controls the requests of the users or requesters in a specific amount of time. Due to rate limiting, the service or API stays protected from overuse, malicious attack, DDoS attack, data traffic spikes, etc. Bucket4j is a java library that has been demonstrated to be effective in rate limiting. While Bucket4j is mainly based on token bucket algorithm, rate limiting processes can be based on various effective algorithms. Selecting the most suitable algorithm for rate limiting is an essential problem. To address it, we have done a detailed analysis of rate-limiting algorithms based on various factors. The factors we have considered are easy implementation, proper handling of data traffic, data starvation, memory usage, etc. We have found out that for different set of requirements, different algorithms are preferable.

Design of highly concurrent course selection system based on microservice

“…At the same time, current limiting can be realized at the gateway. The system adopts Google's open source guava's ratelimiter class to realize the function of current limiting [5]. The algorithm design of current limiting module is shown in Figure 4.…”