Redis Caching & Messaging (Pub/Sub, Streams) · Lezione

Rate limiting e anti-pattern

Progetti e implementi meccanismi efficaci di rate limiting con Redis per proteggere API e servizi.

Rate limiting e anti-pattern è una lezione Redis Caching & Messaging (Pub/Sub, Streams) gratuita su CoddyKit. Questa è la lezione 3 di 4. Puoi leggere la lezione completa qui gratuitamente — poi esercitati direttamente nel browser con un editor di codice integrato e un tutor IA disponibile 24/7. Fa parte del percorso di apprendimento Redis Caching & Messaging (Pub/Sub, Streams), e i tuoi progressi si sincronizzano tra il web e l'app CoddyKit. Il corso Redis Caching & Messaging (Pub/Sub, Streams) include 4 lezioni in totale.

Parti di questa lezione non sono ancora state tradotte e vengono mostrate in inglese.

Why Rate Limit?

Rate limiting is a crucial technique to control the frequency of requests an application receives. Think of it as a bouncer at a club, letting only a certain number of people in at a time.

It protects your APIs and services from:

Abuse: Preventing malicious attacks like brute-force attempts.
Overload: Ensuring your servers aren't overwhelmed by too many requests.
Fair Usage: Distributing access fairly among all users.

Rate Limiting Concepts

When we talk about rate limiting, a few key terms come up:

Limit: The maximum number of requests allowed.
Window: The time period over which the limit applies (e.g., 60 seconds).
Burst: A sudden spike in requests.

Different algorithms exist, like Fixed Window and Sliding Window, each with its own trade-offs.

Redis's Role in Rate Limiting

Redis is an excellent choice for implementing rate limiters due to its speed, in-memory nature, and atomic operations.

Its ability to quickly increment counters and set expirations makes it ideal for tracking request frequencies across a distributed system.

Fixed Window Algorithm

The Fixed Window algorithm is one of the simplest to implement. It works by:

Defining a fixed time window (e.g., 60 seconds).
Counting requests within that window.
Blocking requests once the limit is reached.

At the end of each window, the counter resets. This method is straightforward but can allow bursts of requests at the window boundaries.

Fixed Window in Action

Here's how you can implement a basic fixed-window rate limiter using Redis's INCR and EXPIRE commands.

Try running this Python example:

import redis
import time

r = redis.Redis(decode_responses=True)

def check_rate_limit(user_id, limit_per_min):
    key = f"rl:{user_id}"
    # Increment counter for the user
    current_count = r.incr(key)
    
    # If it's the first request in this window, set expiration
    if current_count == 1:
        r.expire(key, 60) # Expire in 60 seconds
    
    return current_count <= limit_per_min

if __name__ == "__main__":
    test_user = "user_A"
    rate_limit = 3 # 3 requests per minute

    print(f"User '{test_user}' limit: {rate_limit} req/min")

    for i in range(1, 6):
        if check_rate_limit(test_user, rate_limit):
            print(f"Request {i}: ALLOWED")
        else:
            print(f"Request {i}: BLOCKED")
        time.sleep(0.5) # Simulate quick requests
    
    print("\nWaiting for 60s window to reset...")
    # In a real app, this delay would be handled by subsequent requests
    # For demo, we'll clear the key
    r.delete(f"rl:{test_user}") 
    time.sleep(1) # Small pause
    
    print("Window reset. New request:")
    if check_rate_limit(test_user, rate_limit):
        print("Request 1: ALLOWED")
    else:
        print("Request 1: BLOCKED")

Sliding Window Log Algorithm

The Sliding Window Log algorithm offers more accuracy by tracking individual request timestamps.

Here's how it works:

Each request's timestamp is stored in a Redis Sorted Set (ZSET).
When a new request arrives, old timestamps (outside the current window) are removed.
The number of remaining timestamps in the ZSET is the current request count.

This method prevents the burst issue seen at fixed window boundaries.

Sliding Window Demo

Let's see the Sliding Window Log in action. We'll use Redis's ZADD to add timestamps and ZREMRANGEBYSCORE to remove old ones.

Try running this example:

import redis
import time

r = redis.Redis(decode_responses=True)

def check_sliding_window_limit(user_id, limit, window_seconds):
    key = f"rl_sliding:{user_id}"
    current_time = int(time.time() * 1000) # Milliseconds timestamp
    
    # Remove scores older than the window
    r.zremrangebyscore(key, 0, current_time - (window_seconds * 1000))
    
    # Add current request timestamp
    r.zadd(key, {current_time: current_time})
    
    # Set expiration for the key itself to clean up old rate limiters
    # This is a fallback if no new requests come for a long time
    r.expire(key, window_seconds + 5) 
    
    # Count requests in the window
    current_requests = r.zcard(key)
    return current_requests <= limit

if __name__ == "__main__":
    test_user = "user_B"
    rate_limit = 3 # 3 requests per 10 seconds
    window = 10 # seconds

    print(f"User '{test_user}' limit: {rate_limit} req/{window}s (Sliding Log)")

    for i in range(1, 6):
        if check_sliding_window_limit(test_user, rate_limit, window):
            print(f"Request {i}: ALLOWED")
        else:
            print(f"Request {i}: BLOCKED")
        time.sleep(1) # Simulate requests over time
    
    print("\nWaiting for window to slide...")
    time.sleep(window)
    
    print("Window slid. New request:")
    if check_sliding_window_limit(test_user, rate_limit, window):
        print("Request 1: ALLOWED")
    else:
        print("Request 1: BLOCKED")

Common Pitfalls

When implementing rate limiting, avoid these common anti-patterns:

Using KEYS *: Never use this in production to find rate limit keys, as it can block your Redis server.
Ignoring Bursts: Simple fixed windows can allow many requests at window boundaries, which might still overload your service.
Over-engineering: Don't make your rate limiting logic overly complex, as it can introduce bugs and performance overhead.
No Client Feedback: Always return appropriate HTTP status codes (like 429 Too Many Requests) and Retry-After headers.

Rate Limiting Best Practices

To build robust rate limiters with Redis:

Atomic Operations: Always use atomic Redis commands like INCR, ZADD, and EXPIRE to prevent race conditions.
Set Expirations: Ensure your Redis keys have appropriate Time-To-Live (TTL) values to clean up old data.
Choose Wisely: Select the right algorithm (fixed, sliding log, sliding counter) based on your accuracy and performance needs.
Provide Feedback: Inform clients when they are rate-limited using standard HTTP responses.
Monitor: Keep an eye on your rate limiters to ensure they are working as expected and not causing false positives or negatives.

Check Your Knowledge

You've learned about the Fixed Window algorithm. Now, let's test your understanding of the Redis commands involved.

Recap & Next Steps

In this lesson, we explored the critical role of rate limiting in protecting your services and ensuring fair usage. You learned how Redis's speed and atomic operations make it an ideal tool for this.

We covered two fundamental algorithms: the Fixed Window (using INCR and EXPIRE) and the more accurate Sliding Window Log (using ZADD and ZREMRANGEBYSCORE).

Remember to avoid common anti-patterns and follow best practices for robust rate limiting. Keep practicing these patterns to master them!

Domande Frequenti

La lezione «Rate limiting e anti-pattern» è gratuita?

Sì — il testo completo di «Rate limiting e anti-pattern» è gratuito qui sul web. Per esercitarvi in modo interattivo (un editor di codice integrato e un tutor IA 24/7) e sbloccare il resto del corso Redis Caching & Messaging (Pub/Sub, Streams), passa a CoddyKit PRO. Il corso Redis Caching & Messaging (Pub/Sub, Streams) include 4 lezioni in totale.

Cosa imparerò in «Rate limiting e anti-pattern»?

Progetti e implementi meccanismi efficaci di rate limiting con Redis per proteggere API e servizi. Eserciti Redis Caching & Messaging (Pub/Sub, Streams) con codice pratico che esegui direttamente nel browser, e un tutor IA 24/7 risponde alle tue domande mentre lavori sulla lezione.

Ho bisogno di esperienza per iniziare Redis Caching & Messaging (Pub/Sub, Streams)?

Non è richiesta alcuna esperienza precedente. Redis Caching & Messaging (Pub/Sub, Streams) su CoddyKit è strutturato per principianti e studenti avanzati, quindi puoi iniziare da qui o dall'inizio e procedere al tuo ritmo. Questa è la lezione 3 di 4.

Quanto tempo richiede la lezione «Rate limiting e anti-pattern»?

La maggior parte delle lezioni CoddyKit richiede circa 5–10 minuti. Ogni lezione è breve e interattiva, quindi fai progressi costanti e riprendi esattamente da dove hai lasciato su web e app.

Posso scrivere ed eseguire codice in questa lezione Redis Caching & Messaging (Pub/Sub, Streams)?

Sì. Ogni lezione Redis Caching & Messaging (Pub/Sub, Streams) include un editor di codice integrato, quindi scrivi ed esegui codice reale direttamente nel tuo browser e ricevi feedback istantaneo dall'IA — nessuna configurazione locale necessaria.

Tutte le lezioni di questo corso

← Torna a Redis Caching & Messaging (Pub/Sub, Streams)