0Pricing
API Rate Limiting & Scalability Patterns · Ders

Bellek İçi Hız Sınırlayıcı Tasarımı

Tek örnekli uygulamalar için uygun, yaygın programlama kalıplarını kullanan temel bir bellek içi hız sınırlayıcı tasarlayın ve uygulayın.

Bellek İçi Hız Sınırlayıcı Tasarımı, CoddyKit'te ücretsiz bir API Rate Limiting & Scalability Patterns dersidir. Bu, 4 dersinin 1. dersidir. Aşağıdan dersin tamamını ücretsiz okuyabilir, sonra tarayıcıda yerleşik kod editörü ve 7/24 yapay zeka koçu ile uygulamalı olarak pratik yapabilirsin. Bu, API Rate Limiting & Scalability Patterns öğrenme yolunun bir parçasıdır ve ilerlemeniz web ve CoddyKit uygulaması arasında senkronize olur. API Rate Limiting & Scalability Patterns kursu toplamda 4 dersten oluşur.

Bu dersin bazı bölümleri henüz çevrilmemiş olup İngilizce olarak gösterilmektedir.

Intro to In-Memory Limiting

Welcome to designing an in-memory rate limiter! This is the simplest type of rate limiter, perfect for understanding the core concepts.

An in-memory rate limiter stores all its tracking data (like how many requests a user has made) directly in the application's RAM, not in a separate database or service.

This makes it fast and easy to set up, but it comes with specific limitations we'll explore.

Why Use In-Memory?

In-memory rate limiters are ideal for:

  • Single-instance applications: Where your application runs on just one server.
  • Quick prototypes: To test rate limiting concepts without complex infrastructure.
  • Non-critical APIs: Where occasional dropped requests due to server restarts are acceptable.

They are simple to implement because they don't need to communicate with external data stores.

Core Design Concepts

Every rate limiter needs to track a few key pieces of information:

  • Client ID: Who is making the request? (e.g., IP address, user ID, API key)
  • Request Limit: How many requests are allowed? (e.g., 100 requests)
  • Time Window: Over what period? (e.g., per minute, per hour)

Our in-memory design will use these concepts to decide if a request is allowed or denied.

Choosing a Strategy: Fixed Window

For our basic in-memory limiter, we'll use the Fixed Window Counter algorithm. It's straightforward:

  • Requests are counted within a specific, fixed time window (e.g., 0-59 seconds, 60-119 seconds).
  • When a new window starts, the counter resets to zero.
  • If the request count exceeds the limit within the current window, new requests are denied.

While simple, it's a great starting point for understanding rate limiting mechanics.

Data Structures for Tracking

To keep track of requests for different clients within their time windows, we'll use Java's ConcurrentHashMap:

  • counts: A map to store the number of requests for each clientId (e.g., "user1" -> 5).
  • windowStarts: A map to store the start time of the current window for each clientId (e.g., "user1" -> 1678886400000L).

ConcurrentHashMap is thread-safe, which is important when multiple requests might hit our limiter at the same time.

Building the Limiter Class

Let's start by defining our InMemoryRateLimiter class. It will hold our configuration (limit and window duration) and the maps for tracking.

Here's the basic structure:

import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.atomic.AtomicInteger;

public class InMemoryRateLimiter {
    private final int limit; // Max requests allowed
    private final long windowMillis; // Time window in milliseconds

    private final ConcurrentHashMap<String, AtomicInteger> counts = new ConcurrentHashMap<>();
    private final ConcurrentHashMap<String, Long> windowStarts = new ConcurrentHashMap<>();

    public InMemoryRateLimiter(int limit, long windowMillis) {
        this.limit = limit;
        this.windowMillis = windowMillis;
    }

    // The allowRequest method will go here
}

Implementing `allowRequest` - Part 1

The heart of our limiter is the allowRequest(String clientId) method. This method will determine if a request from a given client should be allowed.

First, we get the current time and initialize the window start time for the client if it's their first request:

import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.atomic.AtomicInteger;

public class InMemoryRateLimiter {
    private final int limit;
    private final long windowMillis;

    private final ConcurrentHashMap<String, AtomicInteger> counts = new ConcurrentHashMap<>();
    private final ConcurrentHashMap<String, Long> windowStarts = new ConcurrentHashMap<>();

    public InMemoryRateLimiter(int limit, long windowMillis) {
        this.limit = limit;
        this.windowMillis = windowMillis;
    }

    public boolean allowRequest(String clientId) {
        long currentTime = System.currentTimeMillis();

        // Get or initialize window start time for this client
        long currentWindowStart = windowStarts.computeIfAbsent(clientId, k -> currentTime);

        // ... more logic to come ...
        return false; // Placeholder
    }
}

Implementing `allowRequest` - Part 2

Next, we add the logic to check if the current time window has expired. If it has, we reset the window start time and the request count for that client.

This ensures that when a new window begins, clients get a fresh quota of requests.

import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.atomic.AtomicInteger;

public class InMemoryRateLimiter {
    private final int limit;
    private final long windowMillis;

    private final ConcurrentHashMap<String, AtomicInteger> counts = new ConcurrentHashMap<>();
    private final ConcurrentHashMap<String, Long> windowStarts = new ConcurrentHashMap<>();

    public InMemoryRateLimiter(int limit, long windowMillis) {
        this.limit = limit;
        this.windowMillis = windowMillis;
    }

    public boolean allowRequest(String clientId) {
        long currentTime = System.currentTimeMillis();
        long currentWindowStart = windowStarts.computeIfAbsent(clientId, k -> currentTime);

        // If the current window has expired, reset it
        if (currentTime - currentWindowStart >= windowMillis) {
            windowStarts.put(clientId, currentTime); // Start a new window
            counts.put(clientId, new AtomicInteger(0)); // Reset count
        }

        // ... more logic to come ...
        return false; // Placeholder
    }
}

Implementing `allowRequest` - Part 3

Finally, we increment the request count for the client and check if it's still within the allowed limit. If it is, the request is allowed; otherwise, it's denied.

The AtomicInteger ensures thread-safe increments.

import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.atomic.AtomicInteger;

public class InMemoryRateLimiter {
    private final int limit;
    private final long windowMillis;

    private final ConcurrentHashMap<String, AtomicInteger> counts = new ConcurrentHashMap<>();
    private final ConcurrentHashMap<String, Long> windowStarts = new ConcurrentHashMap<>();

    public InMemoryRateLimiter(int limit, long windowMillis) {
        this.limit = limit;
        this.windowMillis = windowMillis;
    }

    public boolean allowRequest(String clientId) {
        long currentTime = System.currentTimeMillis();
        long currentWindowStart = windowStarts.computeIfAbsent(clientId, k -> currentTime);

        if (currentTime - currentWindowStart >= windowMillis) {
            windowStarts.put(clientId, currentTime);
            counts.put(clientId, new AtomicInteger(0));
        }

        // Increment count and check if within limit
        AtomicInteger clientCount = counts.computeIfAbsent(clientId, k -> new AtomicInteger(0));
        if (clientCount.incrementAndGet() <= limit) {
            return true; // Request allowed
        } else {
            return false; // Request denied
        }
    }

    public static void main(String[] args) {
        // Example usage will go here
    }
}

Full Example and Testing

Let's put it all together and test our in-memory rate limiter! This example creates a limiter allowing 3 requests per 5 seconds for a specific user.

Run the code and observe how requests are allowed initially, then denied, and finally allowed again after the time window resets.

import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.atomic.AtomicInteger;

public class InMemoryRateLimiter {
    private final int limit;
    private final long windowMillis;

    private final ConcurrentHashMap<String, AtomicInteger> counts = new ConcurrentHashMap<>();
    private final ConcurrentHashMap<String, Long> windowStarts = new ConcurrentHashMap<>();

    public InMemoryRateLimiter(int limit, long windowMillis) {
        this.limit = limit;
        this.windowMillis = windowMillis;
    }

    public boolean allowRequest(String clientId) {
        long currentTime = System.currentTimeMillis();
        long currentWindowStart = windowStarts.computeIfAbsent(clientId, k -> currentTime);

        if (currentTime - currentWindowStart >= windowMillis) {
            windowStarts.put(clientId, currentTime);
            counts.put(clientId, new AtomicInteger(0));
        }

        AtomicInteger clientCount = counts.computeIfAbsent(clientId, k -> new AtomicInteger(0));
        if (clientCount.incrementAndGet() <= limit) {
            return true;
        } else {
            return false;
        }
    }

    public static void main(String[] args) throws InterruptedException {
        // Allow 3 requests per 5 seconds for "user1"
        InMemoryRateLimiter limiter = new InMemoryRateLimiter(3, 5000);

        String user = "user1";
        System.out.println("Testing rate limiter for " + user + ": 3 requests / 5 seconds\n");

        for (int i = 0; i < 5; i++) {
            boolean allowed = limiter.allowRequest(user);
            System.out.println("Request " + (i + 1) + ": " + (allowed ? "Allowed" : "Denied"));
            if (i == 2) { // After 3rd request, wait for window to reset
                System.out.println("\n--- Max requests reached. Waiting for window reset (5.5s) ---\n");
                Thread.sleep(5500); // Wait for window to reset
            }
        }

        System.out.println("\n--- Testing after window reset ---\n");
        for (int i = 0; i < 2; i++) {
            boolean allowed = limiter.allowRequest(user);
            System.out.println("Request " + (i + 1) + ": " + (allowed ? "Allowed" : "Denied"));
        }
    }
}

Understanding In-Memory Limitations

While simple and fast, in-memory rate limiters have a critical limitation. Imagine you deploy your application on multiple servers to handle more traffic.

What happens if requests from the same user go to different servers?

Recap: In-Memory Rate Limiting

You've successfully designed and understood a basic in-memory rate limiter!

  • We defined an in-memory rate limiter and its use cases for single-instance apps.
  • We explored key concepts: client ID, limit, and time window.
  • We implemented a Fixed Window Counter using ConcurrentHashMap in Java.
  • You now understand its primary limitation: it's not suitable for distributed systems due to its lack of shared state.

This foundational knowledge is crucial before diving into more advanced, distributed rate limiting solutions!

Sıkça Sorulan Sorular

“Bellek İçi Hız Sınırlayıcı Tasarımı” dersi ücretsiz mi?

Evet — “Bellek İçi Hız Sınırlayıcı Tasarımı” dersin tüm metni burada web'de ücretsiz olarak okunabilir. Etkileşimli olarak pratik yapmak (yerleşik kod editörü ve 7/24 yapay zeka koçu) ve API Rate Limiting & Scalability Patterns kursunun geri kalanını açmak için CoddyKit PRO'ya yükselt. API Rate Limiting & Scalability Patterns kursu toplamda 4 dersten oluşur.

“Bellek İçi Hız Sınırlayıcı Tasarımı” dersinde ne öğreneceğim?

Tek örnekli uygulamalar için uygun, yaygın programlama kalıplarını kullanan temel bir bellek içi hız sınırlayıcı tasarlayın ve uygulayın. API Rate Limiting & Scalability Patterns ile uygulamalı kodu tarayıcıda doğrudan çalıştırarak pratik yaparsın ve 7/24 yapay zeka koçu dersi çalışırken sorularını yanıtlar.

API Rate Limiting & Scalability Patterns öğrenmeye başlamak için deneyim gerekli mi?

Önceden deneyim gerekmez. CoddyKit'te API Rate Limiting & Scalability Patterns, başlangıçtan ileri seviyeye kadar yapılandırıldığı için buradan başlayabilir veya başından başlayıp kendi hızında ilerleme yapabilirsin. Bu, 4 dersinin 1. dersidir.

“Bellek İçi Hız Sınırlayıcı Tasarımı” dersi ne kadar sürer?

Çoğu CoddyKit dersi yaklaşık 5–10 dakika sürer. Her biri kısa ve etkileşimli olduğu için sabit ilerleme yaparsın ve web ile uygulama arasında tam olarak bıraktığın yerden devam edebilirsin.

Bu API Rate Limiting & Scalability Patterns dersinde kod yazıp çalıştırabilir miyim?

Evet. Her API Rate Limiting & Scalability Patterns dersi yerleşik bir kod editörü içerir, bu sayede tarayıcıda gerçek kod yazıp çalıştırabilir ve anlık yapay zeka geri bildirimi alırsın — yerel kurulum gerekli değildir.

Bu kursun tüm dersleri

  1. Bellek İçi Hız Sınırlayıcı Tasarımı
  2. Redis ile Dağıtık Hız Sınırlama
  3. Hız Sınırının Aşılmasıyla Başa Çıkma
  4. Hız Sınırlayıcınızı Test Etme ve İzleme
← API Rate Limiting & Scalability Patterns Sayfasına Dön