Mecânica do algoritmo do balde de tokens
Explore o algoritmo do balde de tokens, compreendendo sua flexibilidade para permitir picos e seus casos de uso comuns em sistemas modernos.
Mecânica do algoritmo do balde de tokens é uma aula grátis de API Rate Limiting & Scalability Patterns no CoddyKit. Esta é a aula 3 de 4. Você pode ler a aula completa abaixo gratuitamente — depois pratica ao vivo no navegador com um editor de código integrado e um tutor de IA 24/7. Faz parte do caminho de aprendizado de API Rate Limiting & Scalability Patterns, e seu progresso é sincronizado entre a web e o app CoddyKit. O curso de API Rate Limiting & Scalability Patterns inclui 4 aulas no total.
Partes desta aula ainda não foram traduzidas e aparecem em inglês.
Meet the Token Bucket
Welcome to the Token Bucket algorithm! After exploring fixed windows and leaky buckets, we'll now dive into a flexible approach that’s widely used in modern systems.
The Token Bucket is a rate-limiting algorithm that allows for bursts of traffic while still enforcing an average rate limit.
Tokens in a Virtual Bucket
Imagine a virtual 'bucket' that holds a certain number of 'tokens'. Each token represents permission for one API request.
- When a request arrives, it tries to take a token.
- If a token is available, the request proceeds, and the token is removed.
- If no tokens are available, the request is typically denied or queued.
Filling Up the Bucket
Tokens are continuously added to the bucket at a constant, predefined rate. This rate determines the average number of requests allowed over time.
For example, if tokens are added at 5 tokens per second, your API can sustain an average of 5 requests per second.
The Bucket's Maximum Size
Just like a real bucket, our virtual token bucket has a maximum capacity. This means it can only hold a certain number of tokens at any given time.
- If tokens are generated but the bucket is full, the new tokens are discarded.
- This capacity limits the maximum size of a 'burst' of requests that can be handled.
Requesting a Token
When an API client makes a request, the rate limiter checks the token bucket:
- If tokens are available: One token is consumed, and the request is allowed to proceed.
- If no tokens are available: The request is blocked, rejected (e.g., with HTTP 429 Too Many Requests), or deferred.
The Power of Bursts
The key advantage of the Token Bucket algorithm is its ability to allow bursts. If the bucket has accumulated many tokens (up to its capacity), a sudden rush of requests can be served immediately.
Once the accumulated tokens are used up, the rate limit reverts to the sustained token generation rate.
Token Bucket in Action
Try running this simplified Java example to see how tokens are refilled and consumed. Notice how initial requests can burst, but subsequent requests depend on refills.
public class Main {
// Simple TokenBucket class for demonstration
static class TokenBucket {
private int capacity;
private int tokens;
private int refillRate; // tokens per "tick"
public TokenBucket(int capacity, int refillRate) {
this.capacity = capacity;
this.tokens = capacity; // Start full
this.refillRate = refillRate;
}
public void refill() {
tokens = Math.min(capacity, tokens + refillRate);
System.out.println("Refill. Tokens: " + tokens);
}
public boolean tryConsume(int numTokens) {
if (tokens >= numTokens) {
tokens -= numTokens;
System.out.println("Consume " + numTokens + ". Left: " + tokens);
return true;
}
System.out.println("Fail to consume " + numTokens + ". Left: " + tokens);
return false;
}
public int getTokens() {
return tokens;
}
}
public static void main(String[] args) {
// Bucket: capacity 5, refills 1 token per tick
TokenBucket bucket = new TokenBucket(5, 1);
System.out.println("Start. Tokens: " + bucket.getTokens());
// 1. Initial burst
System.out.println("\n--- Request 1 (cost 3) ---");
bucket.tryConsume(3); // OK: 5 -> 2
// 2. Simulate time passing (refill)
System.out.println("\n--- Tick 1 ---");
bucket.refill(); // 2 -> 3
// 3. Another request
System.out.println("\n--- Request 2 (cost 2) ---");
bucket.tryConsume(2); // OK: 3 -> 1
// 4. Simulate time passing (refill)
System.out.println("\n--- Tick 2 ---");
bucket.refill(); // 1 -> 2
// 5. Try to consume more than available
System.out.println("\n--- Request 3 (cost 3) ---");
bucket.tryConsume(3); // FAIL: 2 tokens available
// 6. Simulate time passing (refill)
System.out.println("\n--- Tick 3 ---");
bucket.refill(); // 2 -> 3
// 7. Try again with enough tokens
System.out.println("\n--- Request 4 (cost 3) ---");
bucket.tryConsume(3); // OK: 3 -> 0
}
}Why Choose Token Bucket?
The Token Bucket algorithm offers several compelling advantages, especially when compared to simpler methods:
- Allows Bursts: It's perfect for APIs that expect occasional spikes in traffic.
- Simple to Implement: The core logic is straightforward to code.
- Smooth Average Rate: While allowing bursts, it still enforces a consistent average request rate over the long term.
- Flexible: You can tune both the refill rate and bucket capacity to suit different use cases.
Common Use Cases
Token Bucket is widely used in various scenarios where controlled burstiness is desirable:
- API Gateways: To protect backend services from sudden traffic surges.
- Network Traffic Shaping: To smooth out data transmission and prevent network congestion.
- Resource Management: Limiting access to shared resources in distributed systems.
- Client-Side Rate Limiting: Implementing rate limits within client SDKs to prevent excessive requests.
Token Bucket Check
Let's test your understanding of the Token Bucket algorithm.
Token Bucket Summary
Great job! In this lesson, you've learned about the Token Bucket algorithm, a powerful rate-limiting method.
- It uses a virtual bucket that accumulates tokens at a fixed rate.
- Requests consume tokens, and if no tokens are available, requests are denied.
- Its main strength is allowing controlled bursts of traffic, up to the bucket's capacity.
This flexibility makes it a popular choice for many real-world API and network applications.
Perguntas Frequentes
A aula “Mecânica do algoritmo do balde de tokens” é grátis?
Sim — o texto completo de “Mecânica do algoritmo do balde de tokens” é grátis para ler aqui na web. Para praticá-la interativamente (um editor de código integrado e um tutor de IA 24/7) e desbloquear o restante do curso de API Rate Limiting & Scalability Patterns, atualize para CoddyKit PRO. O curso de API Rate Limiting & Scalability Patterns inclui 4 aulas no total.
O que vou aprender em “Mecânica do algoritmo do balde de tokens”?
Explore o algoritmo do balde de tokens, compreendendo sua flexibilidade para permitir picos e seus casos de uso comuns em sistemas modernos. Você pratica API Rate Limiting & Scalability Patterns com código prático que executa diretamente no navegador, e um tutor de IA 24/7 responde suas dúvidas enquanto trabalha na aula.
Preciso ter experiência prévia para começar API Rate Limiting & Scalability Patterns?
Nenhuma experiência prévia é necessária. API Rate Limiting & Scalability Patterns no CoddyKit é estruturado para alunos iniciantes até avançados, então você pode começar aqui ou desde o início e aprender no seu ritmo. Esta é a aula 3 de 4.
Quanto tempo leva a aula “Mecânica do algoritmo do balde de tokens”?
A maioria das aulas CoddyKit leva cerca de 5–10 minutos. Cada uma é compacta e interativa, então você faz progresso constante e retoma exatamente de onde parou entre web e app.
Posso escrever e executar código nesta aula de API Rate Limiting & Scalability Patterns?
Sim. Cada aula de API Rate Limiting & Scalability Patterns inclui um editor de código integrado, então você escreve e executa código real direto no navegador e recebe feedback de IA instantaneamente — nenhuma configuração local necessária.
Todas as aulas deste curso
- Contador de janela fixa explicado
- Análise detalhada do algoritmo do balde furado
- Mecânica do algoritmo do balde de tokens
- Escolha do algoritmo adequado