0Pricing
API Rate Limiting & Scalability Patterns · 강의

메모리 내 속도 제한기 설계

일반적인 프로그래밍 패턴을 사용하여 단일 인스턴스 애플리케이션에 적합한 기본 메모리 내 속도 제한기를 설계하고 구현합니다.

메모리 내 속도 제한기 설계은(는) CoddyKit의 무료 API Rate Limiting & Scalability Patterns 강의입니다. 이것은 4개 중 1번째 강의입니다. 아래에서 전체 강의를 무료로 읽을 수 있으며, 내장 코드 에디터와 24/7 AI 튜터와 함께 브라우저에서 직접 실습할 수 있습니다. 이 강의는 API Rate Limiting & Scalability Patterns 학습 경로의 일부이며, 진행 상황이 웹과 CoddyKit 앱에 동기화됩니다. API Rate Limiting & Scalability Patterns 강의에는 총 4개의 강의가 포함되어 있습니다.

이 강의의 일부는 아직 번역되지 않았으며 영어로 표시됩니다.

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!

자주 묻는 질문

“메모리 내 속도 제한기 설계” 강의는 무료인가요?

네 — “메모리 내 속도 제한기 설계” 전체 내용을 이 웹사이트에서 무료로 읽을 수 있습니다. 인터랙티브하게 실습하려면(내장 코드 에디터와 24/7 AI 튜터), CoddyKit PRO로 업그레이드하면 API Rate Limiting & Scalability Patterns 강의 전체를 잠금 해제할 수 있습니다. API Rate Limiting & Scalability Patterns 강의에는 총 4개의 강의가 포함되어 있습니다.

“메모리 내 속도 제한기 설계”에서 뭘 배우나요?

일반적인 프로그래밍 패턴을 사용하여 단일 인스턴스 애플리케이션에 적합한 기본 메모리 내 속도 제한기를 설계하고 구현합니다. 브라우저에서 직접 실행하는 실습 코드로 API Rate Limiting & Scalability Patterns을(를) 배우며, 24/7 AI 튜터가 강의를 진행하면서 질문에 답변해줍니다.

API Rate Limiting & Scalability Patterns을(를) 시작하는 데 경험이 필요한가요?

사전 경험은 필요하지 않습니다. CoddyKit의 API Rate Limiting & Scalability Patterns은(는) 초급자부터 고급 학습자까지를 위해 구성되어 있으므로, 여기서 시작하거나 처음부터 시작할 수 있으며 자신의 속도대로 진행할 수 있습니다. 이것은 4개 중 1번째 강의입니다.

“메모리 내 속도 제한기 설계” 강의는 얼마나 걸리나요?

대부분의 CoddyKit 강의는 약 5~10분이 소요됩니다. 각 강의는 간결하고 인터랙티브하여 꾸준한 진행이 가능하며, 웹과 앱에서 중단한 부분부터 바로 시작할 수 있습니다.

이 API Rate Limiting & Scalability Patterns 강의에서 코드를 작성하고 실행할 수 있나요?

네. 모든 API Rate Limiting & Scalability Patterns 강의에는 내장 코드 에디터가 포함되어 있으므로, 브라우저에서 바로 실제 코드를 작성하고 실행한 후 즉시 AI 피드백을 받을 수 있습니다 — 로컬 설정이 필요 없습니다.

이 강의의 모든 강의

  1. 메모리 내 속도 제한기 설계
  2. Redis를 활용한 분산 속도 제한
  3. 속도 제한 초과 처리
  4. 요청 제한기 검증 및 모니터링
← API Rate Limiting & Scalability Patterns(으)로 돌아가기