feat(rate-limiter): implement leaky bucket rate limiting algorithm#186
Conversation
|
The latest updates on your projects. Learn more about Vercel for GitHub. |
|
Warning Review limit reached
More reviews will be available in 26 seconds. Learn how PR review limits work. Your organization has run out of usage credits. Purchase more in the billing tab. ⌛ How to resolve this issue?After more reviews become available, a review can be triggered using the We recommend that you space out your commits to avoid hitting the rate limit. 🚦 How do rate limits work?CodeRabbit enforces hourly rate limits for each developer per organization. Our paid plans include higher PR review limits than trial, open-source, and free plans. In all cases, reviews become available again over time. During sustained high-volume PR review activity, CodeRabbit may temporarily slow when the next review becomes available. Please see our Fair Usage Limits Policy for further information. ℹ️ Review info⚙️ Run configurationConfiguration used: defaults Review profile: CHILL Plan: Pro Run ID: 📒 Files selected for processing (6)
✨ Finishing Touches🧪 Generate unit tests (beta)
Thanks for using CodeRabbit! It's free for OSS, and your support helps us grow. If you like it, consider giving us a shout-out. Comment |
Description
This pull request implements the Leaky Bucket rate-limiting algorithm.
The algorithm can be used through the centralized
createRateLimiterAPI or directly via the dedicatedcreateLeakyBucketAlgorithmfunction.The Leaky Bucket algorithm enforces a constant outflow rate by allowing requests to accumulate in a bucket with a fixed capacity while continuously leaking requests at a configured rate. This approach helps smooth traffic bursts and provides predictable request processing over time.
Usage with
createRateLimiterDirect Usage
Features
createRateLimitercreateLeakyBucketAlgorithm