Estratégia do contador de janela deslizante
Aprenda sobre o contador de janela deslizante, uma abordagem mais eficiente em termos de memória que aproxima o método de registro para uso prático.
Estratégia do contador de janela deslizante é uma aula grátis de API Rate Limiting & Scalability Patterns no CoddyKit. Esta é a aula 2 de 4. Você pode ler a aula completa abaixo gratuitamente — depois pratica ao vivo no navegador com um editor de código integrado e um tutor de IA 24/7. Faz parte do caminho de aprendizado de API Rate Limiting & Scalability Patterns, e seu progresso é sincronizado entre a web e o app CoddyKit. O curso de API Rate Limiting & Scalability Patterns inclui 4 aulas no total.
Partes desta aula ainda não foram traduzidas e aparecem em inglês.
Intro to Sliding Window Counter
Welcome to our lesson on the Sliding Window Counter (SWC) algorithm!
This algorithm is a clever way to implement rate limiting. It aims to offer better accuracy than the simple Fixed Window Counter, while being more memory-efficient than the precise Sliding Window Log.
Fixed Window's Flaw
Recall that the Fixed Window Counter can suffer from a 'burst' problem. If a user makes requests right at the end of one window and then again right at the start of the next, they can effectively double their allowed requests in a short period.
The Sliding Window Counter helps to mitigate this issue.
The Core Idea: Blending Windows
Instead of just looking at the current fixed window, SWC looks at two fixed windows:
- The current window.
- The previous window.
It then combines their counts using a weighted average to estimate the true request rate over a 'sliding' period.
How the 'Slide' Happens
The 'sliding' effect comes from how we weight the previous window's count. We calculate an overlap percentage based on how far we are into the current window.
For example, if our window size is 60 seconds and we are 30 seconds into the current window, 50% of the previous window is still 'relevant' to our current sliding view.
Components for Calculation
To apply the Sliding Window Counter, you need to track a few pieces of information:
- The total request count for the previous fixed window.
- The total request count for the current fixed window.
- The current timestamp (to determine how far into the current window we are).
- The defined window size (e.g., 60 seconds, 1 minute).
SWC in Action: Scenario
Let's use an example:
- Rate Limit: 10 requests per minute.
- Current Time: 30 seconds into the current minute.
- Previous Minute's Count: 8 requests.
- Current Minute's Count: 3 requests so far.
How many requests have we 'used' in our sliding window?
Step-by-Step Calculation
Here's how we calculate the estimated count:
- Overlap Percentage: We are 30 seconds into a 60-second window, so 30/60 = 0.5 (or 50%).
- Weighted Previous Count: The previous window's count (8) is weighted by
(1 - overlap percentage). So,8 * (1 - 0.5) = 8 * 0.5 = 4. - Estimated Total: Add the weighted previous count to the current count:
4 (weighted prev) + 3 (current) = 7.
So, 7 requests are estimated, leaving 3 requests remaining.
Implementing SWC Logic
This simple Java code snippet demonstrates how to calculate the estimated request count based on the current state of two windows.
Try running it to see the calculation in action!
public class RateLimitCalculator {
public static double calculateEstimatedRequests(
int previousWindowCount,
int currentWindowCount,
long timeElapsedInCurrentWindowMillis,
long windowSizeMillis) {
double overlapPercentage = (double) timeElapsedInCurrentWindowMillis / windowSizeMillis;
// The core Sliding Window Counter calculation
// It weights the previous window's count based on the *overlap*
// and adds it to the current window's count.
double estimatedCount = previousWindowCount * (1 - overlapPercentage) + currentWindowCount;
return estimatedCount;
}
public static void main(String[] args) {
int maxRequestsPerMinute = 10;
long windowSizeMillis = 60 * 1000; // 1 minute
// Scenario: 30 seconds into the current minute
long timeElapsed = 30 * 1000;
// Previous minute had 8 requests
int prevCount = 8;
// Current minute has 3 requests so far
int currentCount = 3;
double estimated = calculateEstimatedRequests(
prevCount,
currentCount,
timeElapsed,
windowSizeMillis
);
System.out.println("Prev count: " + prevCount);
System.out.println("Current count: " + currentCount);
System.out.println("Elapsed in window: " + (timeElapsed / 1000) + "s");
System.out.println("Window size: " + (windowSizeMillis / 1000) + "s");
System.out.println("\nEstimated requests: " + String.format("%.2f", estimated));
if (estimated < maxRequestsPerMinute) {
System.out.println("Request would likely be allowed.");
} else {
System.out.println("Request would likely be denied.");
}
}
}SWC's Key Benefits
The Sliding Window Counter offers several advantages:
- Improved Accuracy: It provides a better approximation of the true rate than Fixed Window, especially around window boundaries.
- Memory Efficiency: Unlike Sliding Window Log, it doesn't need to store every request timestamp, making it less demanding on memory.
- Better Burst Handling: It reduces the chance of allowing excessive bursts compared to the Fixed Window algorithm.
SWC: Approximation, Not Perfect
While powerful, the Sliding Window Counter is still an approximation. It's not perfectly accurate like the Sliding Window Log.
It can still allow slight overages at window boundaries, though significantly less than a purely Fixed Window approach. For high-precision requirements, the Sliding Window Log might still be preferred, if memory allows.
Quick Check on SWC
Let's test your understanding of the Sliding Window Counter calculation!
Recap & What's Next
Great job! You've learned about the Sliding Window Counter algorithm.
- It combines counts from two fixed windows to approximate a sliding window.
- It's more accurate than Fixed Window and more memory-efficient than Sliding Window Log.
- It calculates an estimated count using an overlap percentage.
Next, we'll compare all the algorithms you've learned to understand their trade-offs.
Aprenda API Rate Limiting & Scalability Patterns com um tutor de IA — grátis
Escreva e execute código real no seu navegador, obtenha ajuda instantânea de um tutor de IA 24/7 e continue de onde parou na web ou no app.
- Cursos
- 12
- Aulas
- 48
Perguntas Frequentes
A aula “Estratégia do contador de janela deslizante” é grátis?
Sim — o texto completo de “Estratégia do contador de janela deslizante” é grátis para ler aqui na web. Para praticá-la interativamente (um editor de código integrado e um tutor de IA 24/7) e desbloquear o restante do curso de API Rate Limiting & Scalability Patterns, atualize para CoddyKit PRO. O curso de API Rate Limiting & Scalability Patterns inclui 4 aulas no total.
O que vou aprender em “Estratégia do contador de janela deslizante”?
Aprenda sobre o contador de janela deslizante, uma abordagem mais eficiente em termos de memória que aproxima o método de registro para uso prático. Você pratica API Rate Limiting & Scalability Patterns com código prático que executa diretamente no navegador, e um tutor de IA 24/7 responde suas dúvidas enquanto trabalha na aula.
Preciso ter experiência prévia para começar API Rate Limiting & Scalability Patterns?
Nenhuma experiência prévia é necessária. API Rate Limiting & Scalability Patterns no CoddyKit é estruturado para alunos iniciantes até avançados, então você pode começar aqui ou desde o início e aprender no seu ritmo. Esta é a aula 2 de 4.
Quanto tempo leva a aula “Estratégia do contador de janela deslizante”?
A maioria das aulas CoddyKit leva cerca de 5–10 minutos. Cada uma é compacta e interativa, então você faz progresso constante e retoma exatamente de onde parou entre web e app.
Posso escrever e executar código nesta aula de API Rate Limiting & Scalability Patterns?
Sim. Cada aula de API Rate Limiting & Scalability Patterns inclui um editor de código integrado, então você escreve e executa código real direto no navegador e recebe feedback de IA instantaneamente — nenhuma configuração local necessária.
Todas as aulas deste curso
- Implementação do registro de janela deslizante
- Estratégia do contador de janela deslizante
- Comparação de algoritmos e compromissos
- Janela deslizante com conjuntos ordenados no Redis