Rate limiting in Microservices - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

Understanding Rate Limiting Purpose

Why is rate limiting important in a microservices architecture?

A To prevent a single client from overwhelming the system with too many requests

B To increase the number of requests a client can send without restrictions

C To allow unlimited access to all clients regardless of usage

D To reduce the number of microservices in the system

💡 Hint

Think about protecting system resources from overload.

Rate limiting controls how many requests a client can make in a time window to avoid system overload and ensure fair usage.

❓ Architecture

intermediate

Choosing Rate Limiting Strategy

Which rate limiting strategy is best suited for a distributed microservices system to ensure consistent limits across instances?

A Local in-memory counters on each service instance

B No rate limiting at all

C Centralized rate limiting using a shared Redis store

D Client-side rate limiting enforced by the user

💡 Hint

Consider how to keep counters consistent across multiple service instances.

Using a centralized store like Redis allows all instances to share rate limit counters, ensuring consistent enforcement.

❓ scaling

advanced

Scaling Rate Limiting for High Traffic

How can you design a rate limiting system that scales efficiently for millions of requests per second in a microservices environment?

A Implement a token bucket algorithm with sharded Redis clusters and local caching

B Use a single Redis instance to store all counters

C Store counters in local memory without synchronization

D Disable rate limiting during peak traffic

💡 Hint

Think about distributing load and reducing latency for counters.

Sharding Redis and using local caches reduces bottlenecks and latency, enabling high throughput rate limiting.

❓ tradeoff

advanced

Tradeoffs in Rate Limiting Granularity

What is a key tradeoff when choosing between user-level and IP-level rate limiting in microservices?

A User-level limits do not require authentication

B User-level limits are easier to implement but less fair

C IP-level limits always provide better security than user-level limits

D IP-level limits can block multiple users behind the same IP, causing unfair restrictions

💡 Hint

Consider shared network environments like offices or mobile carriers.

IP-level limits may block many users sharing an IP, while user-level limits require authentication but are more precise.

❓ estimation

expert

Estimating Capacity for Rate Limiting System

You expect 10 million requests per minute and want to enforce a limit of 100 requests per user per minute. Assuming 1 million unique users, estimate the minimum number of counters your rate limiting system must handle concurrently.

A 100 million counters

B 1 million counters

C 10 million counters

D 100 thousand counters

💡 Hint

Think about how many unique users you track, not total requests.

Each unique user requires one counter, so 1 million users means 1 million counters regardless of total requests.

Practice

1. What is the main purpose of rate limiting in microservices?

easy

A. To control how many requests a user can make in a given time

B. To increase the speed of the service

C. To store user data securely

D. To balance the load between servers

Solution

1. Step 1: Understand the concept of rate limiting

   Rate limiting is designed to restrict the number of requests a user or client can send to a service within a certain time frame.

2. Step 2: Identify the main goal of rate limiting

   The main goal is to prevent overload and abuse by controlling request frequency, not to speed up services or store data.

3. Final Answer:

   To control how many requests a user can make in a given time -> Option A

4. Quick Check:

   Rate limiting = Control request count [OK]

Hint: Rate limiting limits request count per time [OK]

Common Mistakes:

• Confusing rate limiting with load balancing
• Thinking rate limiting speeds up the service
• Mixing rate limiting with data storage

2. Which of the following is the correct way to represent a fixed window rate limiter allowing 100 requests per minute in pseudocode?

easy

A. if requests_in_last_minute < 100 then block else allow

B. if requests_in_last_hour > 100 then block else allow

C. if requests_in_last_minute > 100 then block else allow

D. if requests_in_last_second > 100 then allow else block

Solution

1. Step 1: Understand fixed window rate limiting logic

   Fixed window rate limiting counts requests in a fixed time window (e.g., 1 minute) and blocks if the count exceeds the limit.

2. Step 2: Match the correct condition for allowing or blocking

   If requests exceed 100 in the last minute, block; otherwise, allow. if requests_in_last_minute > 100 then block else allow matches this logic exactly.

3. Final Answer:

   if requests_in_last_minute > 100 then block else allow -> Option C

4. Quick Check:

   Fixed window limit = block if over limit [OK]

Hint: Block when requests exceed limit in fixed window [OK]

Common Mistakes:

• Using wrong time window (hour instead of minute)
• Reversing the condition (blocking when under limit)
• Allowing requests when they should be blocked

3. Given this pseudocode for a token bucket rate limiter:

bucket_capacity = 5
refill_rate = 1 token per second
current_tokens = 3
request_tokens = 2
if current_tokens >= request_tokens:
    current_tokens -= request_tokens
    allow request
else:
    block request

What happens if a request for 4 tokens arrives immediately?

medium

A. Request is allowed and tokens reduce to -1

B. Request is blocked because refill rate is too low

C. Request is allowed and tokens reduce to 1

D. Request is blocked because not enough tokens

Solution

1. Step 1: Check current tokens against requested tokens

   Current tokens are 3, request needs 4 tokens, which is more than available.

2. Step 2: Determine if request is allowed or blocked

   Since current tokens (3) < request tokens (4), the request is blocked.

3. Final Answer:

   Request is blocked because not enough tokens -> Option D

4. Quick Check:

   Tokens < request = block [OK]

Hint: Allow only if tokens ≥ requested tokens [OK]

Common Mistakes:

• Allowing request when tokens are insufficient
• Ignoring token count and refill rate
• Assuming tokens can go negative

4. A microservice uses a sliding window rate limiter but users report some requests are blocked even when they seem under the limit. Which is the most likely cause?

medium

A. The sliding window is not updating timestamps correctly

B. The service has too many servers without shared state

C. The rate limit is set too high

D. The users are sending requests too slowly

Solution

1. Step 1: Understand sliding window rate limiter behavior

   Sliding window requires accurate tracking of request timestamps across all servers to count requests correctly.

2. Step 2: Identify issue with multiple servers and no shared state

   If servers do not share state, each counts requests independently, causing incorrect blocking even if total requests are under limit.

3. Final Answer:

   The service has too many servers without shared state -> Option B

4. Quick Check:

   Multiple servers need shared state for sliding window [OK]

Hint: Sliding window needs shared state across servers [OK]

Common Mistakes:

• Blaming slow user requests
• Assuming rate limit is too high causes blocking
• Ignoring distributed state issues

5. You design a rate limiter for a microservice that must handle 10 million users, each allowed 100 requests per hour. Which approach best balances accuracy and scalability?

hard

A. Use distributed token buckets with local caches and periodic sync

B. Use a centralized fixed window counter stored in a single database

C. Use client-side rate limiting without server checks

D. Use a sliding window log storing every request timestamp centrally

Solution

1. Step 1: Analyze scalability needs for 10 million users

   A centralized database (Use a centralized fixed window counter stored in a single database) or storing every timestamp centrally (Use a sliding window log storing every request timestamp centrally) will cause bottlenecks and high latency.

2. Step 2: Evaluate distributed token bucket with local caches

   Distributed token buckets with local caches reduce central load and sync periodically, balancing accuracy and scalability well.

3. Step 3: Consider client-side rate limiting

   Client-side (Use client-side rate limiting without server checks) is unreliable as clients can bypass limits.

4. Final Answer:

   Use distributed token buckets with local caches and periodic sync -> Option A

5. Quick Check:

   Distributed token bucket = scalable + accurate [OK]

Hint: Distributed token buckets scale best for millions [OK]

Common Mistakes:

• Choosing centralized storage causing bottlenecks
• Relying only on client-side limits
• Storing all request logs centrally causing overload