<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title>MicroService - 分类 - Victor's Code Journey</title><link>http://www.victorchu.info/categories/microservice/</link><description>MicroService - 分类 - Victor's Code Journey</description><generator>Hugo -- gohugo.io</generator><language>zh-cn</language><managingEditor>victorchu0610@outlook.com (victorchutian)</managingEditor><webMaster>victorchu0610@outlook.com (victorchutian)</webMaster><lastBuildDate>Tue, 30 Jun 2026 14:15:08 +0800</lastBuildDate><atom:link href="http://www.victorchu.info/categories/microservice/" rel="self" type="application/rss+xml"/><item><title>限流简介</title><link>http://www.victorchu.info/posts/2026/06/8ce642df/</link><pubDate>Tue, 30 Jun 2026 14:15:08 +0800</pubDate><author><name>victorchutian</name></author><guid>http://www.victorchu.info/posts/2026/06/8ce642df/</guid><description>&lt;p>限流是高并发系统里最朴素的自我保护手段：当流量超过系统承载上限时，主动拒绝或排队部分请求，换取整体稳定。&lt;/p>
&lt;p>这篇文章从固定窗口、滑动窗口、漏桶、令牌桶、GCRA 五类经典算法讲起，用 Redis Lua 脚本还原实现细节，再分析 Redisson RateLimiter 的设计本质，最后落到分布式限流的三大关键问题与生产选型建议。如果你正在设计或优化一套限流方案，这篇文章会是一张清晰的路线图。&lt;/p></description></item></channel></rss>