API Rate Limiting & Scalability Patterns · درس

تحديد المعدل الموزّع باستخدام Redis

تعلّم الاستفادة من Redis لبناء محددات معدل موزّعة وموثوقة وقابلة للتوسّع تعمل عبر نسخ متعددة من الخدمة

تحديد المعدل الموزّع باستخدام Redis درس مجاني في API Rate Limiting & Scalability Patterns على CoddyKit. هذا هو الدرس 2 من أصل 4. يمكنك قراءة الدرس كاملاً أدناه مجاناً — ثم تمرن عليه مباشرة في المتصفح باستخدام محرر أكواد مدمج ومدرس ذكاء اصطناعي متاح 24/7. هذا الدرس جزء من مسار التعلم في API Rate Limiting & Scalability Patterns، وتقدمك يتزامن عبر الويب وتطبيق CoddyKit. تتضمن دورة API Rate Limiting & Scalability Patterns 4 دروس في المجموع.

بعض أجزاء هذا الدرس لم تُترجم بعد وتظهر باللغة الإنجليزية.

Scaling Beyond Single Server

In previous lessons, we learned about basic rate limiting. But what happens when your application grows and runs on multiple servers?

In-memory limits: They only track requests on a single server.
Multiple servers: Each server has its own counter, leading to inaccurate and ineffective limits.
The problem: Users can bypass limits by hitting different servers.

We need a way for all servers to share the same rate limit state.

Introducing Redis for Shared State

To build a distributed rate limiter, we need a centralized, fast data store accessible by all our application instances. This is where Redis shines!

What is Redis? An open-source, in-memory data structure store.
Why Redis? It's extremely fast, supports various data types, and is designed for concurrent access.
Key for Rate Limiting: Its atomic operations are perfect for incrementing counters reliably across multiple services.

Redis Commands for Counters

Redis provides simple yet powerful commands that are ideal for building rate limiters. The two main ones you'll use are INCR and EXPIRE.

INCR key: Atomically increments the number stored at key by one. If the key doesn't exist, it's set to 0 before incrementing.
EXPIRE key seconds: Sets a timeout on key. After the timeout, the key is automatically deleted. This is crucial for defining our rate limiting windows.

These commands ensure our counters are consistent even with many concurrent requests.

Implementing Fixed Window with Redis

Let's consider a Fixed Window Counter algorithm using Redis. Imagine we want to limit a user to 5 requests per 60 seconds.

Define a key: A unique key for the user and the current time window, e.g., user:123:2023-10-27-10:00.
Increment Counter: When a request comes in, use INCR on this key.
Set Expiry: For the first request in a new window, also use EXPIRE to set the key's timeout (e.g., 60 seconds).
Check Limit: Before incrementing, check if the current count for the key is less than the allowed limit.

Basic Redis Fixed Window Code

Here's a simple Python example for a fixed window rate limiter using Redis. This snippet shows the core logic without full error handling.

import redis
import time

def is_rate_limited(user_id, limit, window_seconds):
    r = redis.Redis(host='localhost', port=6379, db=0)
    current_minute = int(time.time() // window_seconds)
    key = f"rate_limit:{user_id}:{current_minute}"

    count = r.get(key)
    if count is None:
        r.setex(key, window_seconds, 0) # Initialize and set expiry
        count = 0
    else:
        count = int(count)

    if count < limit:
        r.incr(key)
        return False # Not rate limited
    return True # Rate limited

if __name__ == "__main__":
    user = "user_alice"
    requests_limit = 5
    time_window = 60 # seconds

    print(f"Testing rate limiter for {user} ({requests_limit} reqs/{time_window}s)")
    for i in range(1, 8):
        if is_rate_limited(user, requests_limit, time_window):
            print(f"Request {i}: Rate limited!")
        else:
            print(f"Request {i}: OK")
            time.sleep(0.1) # Simulate some work

Addressing Race Conditions

In the previous example, the `get`, `setex`, and `incr` operations are separate. This can lead to a race condition:

Two requests might `GET` the key when it doesn't exist.
Both might `SETEX` it, potentially overwriting each other's expiry.
The `EXPIRE` might not be set for the *first* incremented value, causing the counter to persist indefinitely.

We need to perform these multiple Redis commands as a single, atomic operation.

Atomic Operations with Lua Scripts

Redis allows you to execute server-side Lua scripts. This is incredibly powerful for rate limiting because:

Atomicity: A Lua script runs as a single, indivisible command. No other Redis commands can interrupt it.
Efficiency: Reduces network round trips for complex operations.

We can write a Lua script to check the counter, increment it, and set its expiry all in one go.

Lua Script Example for Limiter

Here's a Lua script for an atomic fixed window counter. It takes the key, limit, and window duration as arguments.

local key = KEYS[1]
local limit = tonumber(ARGV[1])
local window = tonumber(ARGV[2])

local current_count = redis.call('INCR', key)

if current_count == 1 then
    redis.call('EXPIRE', key, window)
end

if current_count > limit then
    return 1 -- Rate limited
else
    return 0 -- Not rate limited
end

Python Calling Lua Script

Now, let's see how to integrate and execute this Lua script from our Python application. The EVAL command sends the script to Redis for atomic execution.

import redis
import time

def is_rate_limited_atomic(user_id, limit, window_seconds):
    r = redis.Redis(host='localhost', port=6379, db=0)
    current_minute = int(time.time() // window_seconds)
    key = f"rate_limit_atomic:{user_id}:{current_minute}"

    # The Lua script to execute
    lua_script = """
    local key = KEYS[1]
    local limit = tonumber(ARGV[1])
    local window = tonumber(ARGV[2])

    local current_count = redis.call('INCR', key)

    if current_count == 1 then
        redis.call('EXPIRE', key, window)
    end

    if current_count > limit then
        return 1 -- Rate limited
    else
        return 0 -- Not rate limited
    end
    """

    # Execute the Lua script atomically
    # KEYS[1] is 'key'
    # ARGV[1] is 'limit', ARGV[2] is 'window_seconds'
    result = r.eval(lua_script, 1, key, limit, window_seconds)
    return bool(result)

if __name__ == "__main__":
    user = "user_bob"
    requests_limit = 5
    time_window = 60 # seconds

    print(f"Testing atomic rate limiter for {user} ({requests_limit} reqs/{time_window}s)")
    for i in range(1, 8):
        if is_rate_limited_atomic(user, requests_limit, time_window):
            print(f"Request {i}: Rate limited!")
        else:
            print(f"Request {i}: OK")
            time.sleep(0.1) # Simulate some work

Distributed Limiting Check

Which of the following are key benefits of using Redis for distributed rate limiting, especially when using Lua scripting?

Recap: Redis for Scale

Great job! You've learned how to build robust distributed rate limiters using Redis.

Distributed Problem: In-memory limits fail with multiple application instances.
Redis Solution: Provides a fast, centralized, and shared state for rate limit counters.
Key Commands: INCR and EXPIRE are fundamental.
Atomicity with Lua: Crucial for preventing race conditions and ensuring correctness when multiple Redis commands are involved.

This approach is foundational for building scalable and resilient APIs.

الأسئلة الشائعة

هل درس «تحديد المعدل الموزّع باستخدام Redis» مجاني؟

نعم — نص درس «تحديد المعدل الموزّع باستخدام Redis» كامل متاح مجاناً هنا على الويب. لتمرينه بشكل تفاعلي (محرر أكواد مدمج ومدرس ذكاء اصطناعي متاح 24/7) وفتح باقي دورة API Rate Limiting & Scalability Patterns، انتقل إلى CoddyKit PRO. تتضمن دورة API Rate Limiting & Scalability Patterns 4 دروس في المجموع.

ماذا ستتعلم في «تحديد المعدل الموزّع باستخدام Redis»؟

تعلّم الاستفادة من Redis لبناء محددات معدل موزّعة وموثوقة وقابلة للتوسّع تعمل عبر نسخ متعددة من الخدمة تتمرن على API Rate Limiting & Scalability Patterns مع أكواد عملية تشغلها مباشرة في المتصفح، ومدرس ذكاء اصطناعي متاح 24/7 يجيب على أسئلتك أثناء عملك.

هل أحتاج إلى خبرة سابقة لأبدأ API Rate Limiting & Scalability Patterns؟

لا تُشترط خبرة سابقة. API Rate Limiting & Scalability Patterns على CoddyKit منظم للمبتدئين حتى المتقدمين، لذا يمكنك البدء من هنا أو من البداية والتقدم بسرعتك الخاصة. هذا هو الدرس 2 من أصل 4.

كم من الوقت يستغرق درس «تحديد المعدل الموزّع باستخدام Redis»؟

معظم دروس CoddyKit تستغرق حوالي 5–10 دقائق. كل منها موجز وتفاعلي، لذا تحرز تقدماً مستمراً وتستأنف من حيث توقفت عبر الويب والتطبيق.

هل يمكنني كتابة وتشغيل أكواد في درس API Rate Limiting & Scalability Patterns هذا؟

نعم. كل درس في API Rate Limiting & Scalability Patterns يتضمن محرر أكواد مدمج، لذا تكتب وتشغل أكواداً حقيقية مباشرة في متصفحك وتحصل على تعليقات فورية من الذكاء الاصطناعي — بدون إعداد محلي.

جميع الدروس في هذه الدورة

← العودة إلى API Rate Limiting & Scalability Patterns