ScholarGate
助手
Process / pipelineTraffic shaping

令牌桶速率限制算法

令牌桶是一种简单而优雅的流量整形和速率限制算法。一个虚拟桶以固定速率(承诺信息速率)累积令牌。传入的数据包消耗令牌(每字节一个令牌);仅当有足够令牌可用时,数据包才会被传输。如果桶已满,多余的令牌将被丢弃(不累积)。令牌桶限制了峰值速率并允许受控的突发流量,使其成为网络流量管理的理想选择。

在 MethodMind 中打开即将推出视频即将推出Download slides

阅读完整方法

仅限会员

使用免费账户登录即可阅读本节。

登录

Method map

The neighbourhood of related methods — select a node to explore.

来源

  1. Turner, J. S. (1986). New directions in communications (or which way to the information age?). IEEE Communications Magazine, 24(10), 8-15. link
  2. Heinanen, J., Guerin, R., & May, A. (1999). A Single Rate Three Color Marker. RFC 2697. link

如何引用本页

ScholarGate. (2026, June 3). Token Bucket Rate Limiting Algorithm. ScholarGate. https://scholargate.app/zh/telecommunications/token-bucket

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

被引用于

ScholarGateToken Bucket (Token Bucket Rate Limiting Algorithm). 于 2026-06-15 检索自 https://scholargate.app/zh/telecommunications/token-bucket · 数据集: https://doi.org/10.5281/zenodo.20539026