API Rate Limiting & Scalability Patterns · 课时

滑动窗口计数器策略

学习滑动窗口计数器，了解这种更节省内存的方法如何近似实现日志算法，以满足实际使用需求。

滑动窗口计数器策略 是 CoddyKit 上的免费 API Rate Limiting & Scalability Patterns 课时。这是第 2 节课，共 4 节。你可以在下方免费阅读本课时的完整内容 — 然后在浏览器中使用内置代码编辑器和全天候 AI 导师进行实践。这是 API Rate Limiting & Scalability Patterns 学习路径的一部分，你的进度在网页和 CoddyKit 应用中同步。 API Rate Limiting & Scalability Patterns 课程共包含 4 节课。

本课时的部分内容尚未翻译，以英文显示。

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.

常见问题解答

「滑动窗口计数器策略」课时是免费的吗？

是的 — 「滑动窗口计数器策略」的完整文本可在网页上免费阅读。要进行交互式练习（内置代码编辑器和全天候 AI 导师）并解锁 API Rate Limiting & Scalability Patterns 课程的其余内容，请升级到 CoddyKit PRO。 API Rate Limiting & Scalability Patterns 课程共包含 4 节课。

「滑动窗口计数器策略」这节课中我会学到什么？

学习滑动窗口计数器，了解这种更节省内存的方法如何近似实现日志算法，以满足实际使用需求。你通过在浏览器中直接运行的动手代码来练习 API Rate Limiting & Scalability Patterns，全天候 AI 导师会在你学习这节课的过程中回答你的问题。

学习 API Rate Limiting & Scalability Patterns 需要有经验吗？

无需任何先前经验。CoddyKit 上的 API Rate Limiting & Scalability Patterns 课程适合初学者到高级学习者，你可以从这里开始或从头开始，按照自己的节奏学习。这是第 2 节课，共 4 节。

「滑动窗口计数器策略」课时需要多长时间？

大多数 CoddyKit 课程大约需要 5–10 分钟。每节课都很精短且互动，所以你能稳步进步，并在网页和应用中从离开的地方继续。

我能在这节 API Rate Limiting & Scalability Patterns 课中编写并运行代码吗？

能。每节 API Rate Limiting & Scalability Patterns 课都包含内置代码编辑器，你可以在浏览器中直接编写并运行真实代码，并获得即时 AI 反馈 — 无需本地设置。

此课程中的所有课时

← 返回 API Rate Limiting & Scalability Patterns