知识卡片
漏桶平滑输出有等待代价
漏桶将到达请求排队,按受控速率放出,保护处理能力固定的下游。队列必须有容量和等待上限,过量时拒绝,否则只是把过载变成持续增长的延迟;与令牌桶相比更强调平滑输出。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- Building Resilient Systems · 查看原书依据
Leaky Bucket Algorithm: Leaky Bucket algorithm provides a more stringent approach to rate limiting, enforcing a consistent outflow rate. This makes it particularly suitable for protecting downstream services that have fixed processing capacity.
参考来源
- 位置:《Building Distributed Systems Designing scalable architectures with microservices, event-driven patterns, and robust deployment…》第08章《Building Resilient Systems》(来源项目book-sources;源文件:extracted/Building Distributed Systems Designing scalable architectures with microservices, event-driven patterns, and robust deployment…/_epub-src/OPS/ch08.xhtml)
- 结论依据:原文的机制或对比支持以下核心判断:漏桶将到达请求排队,按受控速率放出,保护处理能力固定的下游。 本卡将相邻说明中的适用限制保留为解释。
- 原始内容:Leaky Bucket Algorithm: Leaky Bucket algorithm provides a more stringent approach to rate limiting, enforcing a consistent outflow rate. This makes it particularly suitable for protecting downstream services that have fixed processing capacity.