<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Google on Mi&amp;Bee Blog</title><link>/tags/google/</link><description>Recent content in Google on Mi&amp;Bee Blog</description><generator>Hugo -- gohugo.io</generator><language>zh-CN</language><managingEditor>蓝宝石的傻话</managingEditor><lastBuildDate>Sun, 10 May 2026 00:00:00 +0000</lastBuildDate><atom:link href="/tags/google/rss.xml" rel="self" type="application/rss+xml"/><item><title>BBR 拥塞控制算法深度解析</title><link>/posts/network/bbr-algorithm-deep-dive/</link><pubDate>Sun, 10 May 2026 00:00:00 +0000</pubDate><guid>/posts/network/bbr-algorithm-deep-dive/</guid><description>&lt;p&gt;BBR（Bottleneck Bandwidth and Round-trip propagation time）由 Google 的 Neal Cardwell、Yuchung Cheng 等人开发，是目前最先进的基于模型的拥塞控制算法之一。与传统的基于丢包的算法（如 Reno、CUBIC）不同，BBR 通过直接测量网络的瓶颈带宽和传播延迟来建模网络路径，在瓶颈点以 BDP（带宽延迟积）速率发送数据。&lt;/p&gt;</description></item></channel></rss>