API Rate Limiting & Scalability Patterns · Pelajaran

Rancangan Pembatas Laju Dalam Memori

Rancang dan terapkan pembatas laju dasar dalam memori yang sesuai untuk aplikasi satu instans menggunakan pola pemrograman umum.

Pelajaran 1 dari 412 langkah

Rancangan Pembatas Laju Dalam Memori adalah pelajaran API Rate Limiting & Scalability Patterns gratis di CoddyKit. Ini adalah pelajaran 1 dari 4. Kamu bisa membaca pelajaran lengkapnya di bawah secara gratis — lalu praktikkan langsung di browser dengan editor kode bawaan dan tutor AI 24/7. Ini adalah bagian dari jalur belajar API Rate Limiting & Scalability Patterns, dan progresmu tersinkronisasi di web dan aplikasi CoddyKit. Kursus API Rate Limiting & Scalability Patterns mencakup 4 pelajaran total.

Bagian dari pelajaran ini belum diterjemahkan dan ditampilkan dalam bahasa Inggris.

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?

Jawab di pelajaran interaktif

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!

Gratis untuk memulai

Belajar API Rate Limiting & Scalability Patterns dengan tutor AI — gratis

Tulis dan jalankan kode asli di browser kamu, dapatkan bantuan instan dari tutor AI 24/7, dan lanjutkan di mana kamu tinggalkan di web atau aplikasi.

Kursus: 12
Pelajaran: 48

Mulai belajar gratis Lihat kursus lengkapnya

Pertanyaan yang Sering Diajukan

Apakah pelajaran “Rancangan Pembatas Laju Dalam Memori” gratis?

Ya — teks lengkap “Rancangan Pembatas Laju Dalam Memori” gratis dibaca di sini di web. Untuk praktiknya secara interaktif (editor kode bawaan dan tutor AI 24/7) dan buka sisa kursus API Rate Limiting & Scalability Patterns, upgrade ke CoddyKit PRO. Kursus API Rate Limiting & Scalability Patterns mencakup 4 pelajaran total.

Apa yang akan aku pelajari di “Rancangan Pembatas Laju Dalam Memori”?

Rancang dan terapkan pembatas laju dasar dalam memori yang sesuai untuk aplikasi satu instans menggunakan pola pemrograman umum. Kamu berlatih API Rate Limiting & Scalability Patterns dengan kode praktik yang langsung kamu jalankan di browser, dan tutor AI 24/7 menjawab pertanyaanmu saat kamu mengerjakan pelajaran ini.

Apakah aku perlu pengalaman untuk memulai API Rate Limiting & Scalability Patterns?

Tidak diperlukan pengalaman sebelumnya. API Rate Limiting & Scalability Patterns di CoddyKit dirancang untuk pemula hingga pelajar tingkat lanjut, jadi kamu bisa memulai di sini atau dari awal dan belajar sesuai kecepatan kamu sendiri. Ini adalah pelajaran 1 dari 4.

Berapa lama pelajaran “Rancangan Pembatas Laju Dalam Memori” memakan waktu?

Sebagian besar pelajaran CoddyKit memakan waktu sekitar 5–10 menit. Setiap pelajaran ringkas dan interaktif, jadi kamu membuat kemajuan stabil dan melanjutkan dari tempat kamu tinggalkan di web dan aplikasi.

Bisakah aku menulis dan menjalankan kode dalam pelajaran API Rate Limiting & Scalability Patterns ini?

Ya. Setiap pelajaran API Rate Limiting & Scalability Patterns menyertakan editor kode bawaan, jadi kamu menulis dan menjalankan kode nyata langsung di browser dan mendapatkan umpan balik AI instan — tidak diperlukan penyiapan lokal.

Semua pelajaran dalam kursus ini

Rancangan Pembatas Laju Dalam Memori
Pembatasan Laju Terdistribusi dengan Redis
Menangani Pelampauan Batas Laju
Menguji dan Memantau Pembatas Laju Anda

← Kembali ke API Rate Limiting & Scalability Patterns