奈飞开源的自适应限流库。当服务在面对高并发处理不过来的时候，通常会采用限流的方式来保证服务可以正常运行，但限流的阈值很难精准把控，设置小了会损失流量、大了又容易搞挂服务。该项目基于 TCP 拥塞控制算法，实现了自适应并发限制，即自动设置最佳限流阈值，从而能够在保证服务稳定的前提下，尽可能多地处理请求。
active 2023-08-15 → 2026-10-13 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1156 days from 2023-08-15 to 2026-10-13. Pushes: 36 total, peak 7 in a day. Pull requests: 49 total, peak 7 in a day. Issues: 20 total, peak 5 in a day. Comments: 77 total, peak 14 in a day. Stars: 494 total, peak 36 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Stars, PRs, issues and forks are under-captured in the later part of this window. GH Archive progressively stopped capturing non-push events during 2026 — −95% or worse by the end of the window. Every series here except Pushes fades for that reason, so a decline above reflects the archive, not this repository. Pushes stay reliable throughout, so read them, and the contributor counts derived from them, as the real signal. Data health has the measurements.
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| umairk79 | 73 | 21 | 18 | 15 |
| fedorka | 47 | 5 | 2 | 23 |
| jasonk000 | 29 | 0 | 2 | 13 |
| enbnt | 24 | 1 | 1 | 10 |
| kilink | 20 | 4 | 8 | 4 |
| ayangster | 11 | 3 | 4 | 2 |
| agshing | 8 | 0 | 2 | 2 |
| tokgrabber | 5 | 0 | 0 | 0 |
| Jon-Gaara | 4 | 0 | 0 | 2 |
| Meijuh | 3 | 0 | 2 | 1 |
| jhalterman | 3 | 0 | 0 | 2 |
| OdysseusLives | 2 | 1 | 1 | 0 |
| parveensaini | 2 | 0 | 0 | 1 |
| kul | 2 | 0 | 1 | 1 |
| arouel | 2 | 0 | 2 | 0 |
| ag-wnl | 2 | 0 | 2 | 0 |
| rpalcolea | 2 | 1 | 1 | 0 |
| YeonCheolGit | 1 | 0 | 1 | 0 |
| QiuYucheng2003 | 1 | 0 | 0 | 0 |
| ekadet-f9 | 1 | 0 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 494 stars here means stars gained during the window, not the repo's star count.