[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fcHPDEvoN0rjl3Uk2dGg72IqqKd_syDwmVKCzCpj3cbs":3},{"item":4,"related":44},{"id":5,"type":6,"title":7,"slug":8,"summary":9,"body":10,"coverUrl":11,"productScreenshots":12,"productLinks":13,"authorName":14,"authorUrl":15,"authorSubject":16,"category":17,"tags":22,"sourceLabel":35,"sourceName":36,"sourceUrl":37,"status":38,"seoTitle":7,"seoDescription":9,"canonicalUrl":35,"isFeatured":39,"sno":40,"sortOrder":41,"publishedAt":42,"updatedAt":43,"createdAt":43},"e4131e64-25af-4b75-8c90-d78212d5b7d9","article","BBR：网络拥塞为什么不能只看丢包？","bbr-bandwidth-round-trip-congestion-control","BBR 通过估计瓶颈带宽和往返传播时间来调节发送速率，把吞吐、延迟与在途数据纳入拥塞控制，而不是只等待丢包。","很多人把网络拥塞和丢包画上等号：丢包变多，就降低发送速度。BBR（Bottleneck Bandwidth and Round-trip propagation time）提出的观察角度不同，它试图直接估计链路的瓶颈带宽和往返传播时间，再据此决定发送速率和在途数据量。\n\n把网络想成一条水管。丢包像水从接缝漏出来，但漏水也可能来自拥塞、无线干扰或队列溢出。只盯着漏水来调节，可能在链路已经拥塞之前反应太晚，也可能在没有真正拥塞时过度降速。BBR 更像是在测量水管最窄处能通过多少水，以及水从一端到另一端要多久。\n\n瓶颈带宽描述稳定传输时的上限，RTprop 则近似表示没有排队时的传播延迟。两者结合，可以让发送器既保持较高吞吐，也尽量不把队列填得过深。BBR 会在不同阶段探测带宽和延迟，观察确认反馈，再调整 pacing rate 和拥塞窗口，而不是把单个丢包当作唯一信号。\n\n这并不表示 BBR 永远优于基于丢包的算法。不同版本和实现对公平性、队列、短流和竞争流的表现可能不同，网络设备和对端行为也会影响结果。发送器仍需处理确认延迟、应用受限、无线波动和测量误差；一个不准确的带宽估计同样会造成拥塞。\n\nBBR 的启发在于：控制系统不该只盯着“坏结果”，还应该测量系统内部的容量和延迟。对网络来说，吞吐、RTT、在途数据和丢包都只是观测信号；用更多信号建立模型，才能在高带宽、长距离和复杂无线环境中作出更平滑的调节。\n\n从控制理论看，BBR 代表了从“对丢包作反应”转向“主动测量系统状态”。发送器观察确认反馈形成估计，估计再影响下一轮发送；测量窗口太短会受噪声影响，太长又会跟不上链路变化。因此实际算法需要探测、稳定和回退，不能只用一个静态带宽数字。\n\n资料来源：[Google Research：BBR: Congestion-Based Congestion Control](https:\u002F\u002Fresearch.google\u002Fpubs\u002Fbbr-congestion-based-congestion-control\u002F)","\u002Fuploads\u002F2026-09-26\u002F7a21c7b9-a2ee-4f70-b3fe-b10fca22655d.jpg",[],[],"Foundit","https:\u002F\u002Ffoundit.cn","foundit-ai-editorial",{"id":18,"name":19,"slug":20,"description":21},"6179d3b6-dc34-4483-9ded-3cd9f1b37a47","科普","abbreviation","介绍各领域新兴概念",[23,27,31],{"id":24,"name":25,"slug":26},"7c76bfc2-f80f-4ee0-a95d-27bd8708b434","技术","slug",{"id":28,"name":29,"slug":30},"4c2bbea6-eab7-40a8-8447-1de478ff7749","分析","analyse",{"id":32,"name":33,"slug":34},"68cedb55-2cac-412f-8f81-fda8c7d686dd","思考","thought",null,"Google Research：BBR: Congestion-Based Congestion Control","https:\u002F\u002Fresearch.google\u002Fpubs\u002Fbbr-congestion-based-congestion-control\u002F","published",false,53,0,"2026-09-27T00:00:00.000Z","2026-09-26T16:26:20.942Z",[45,54,61],{"id":46,"type":6,"title":47,"slug":48,"summary":49,"coverUrl":50,"authorName":14,"sno":51,"publishedAt":52,"createdAt":53},"58fc0fe2-4392-402e-bd43-68da30f7b50f","RPKI 路由源验证：怎样确认一个网络前缀确实由某个 AS 宣告？","rpki-bgp-route-origin-validation","RPKI 路由源验证通过 ROA 检查前缀与起源 AS 是否匹配。本文解释 Valid、Invalid、NotFound 的含义，以及它为何不验证整条路由路径。","\u002Fuploads\u002F2026-10-06\u002F073132a3-dfee-42bd-b7f1-9f6805946e8b.jpg",40,"2026-10-06T00:00:00.000Z","2026-10-06T07:51:36.206Z",{"id":55,"type":6,"title":56,"slug":57,"summary":58,"coverUrl":59,"authorName":14,"sno":40,"publishedAt":52,"createdAt":60},"d9dbb54d-46d3-4b1b-ad49-e4e049264170","Sloppy Quorum 与 Hinted Handoff：副本故障时，数据能先寄存到别处吗？","sloppy-quorum-hinted-handoff-replica-recovery","Dynamo 风格的宽松 quorum 可在首选副本不可达时暂存写入，并通过 hinted handoff 在故障恢复后补回。本文解释其可用性收益与一致性边界。","\u002Fuploads\u002F2026-10-06\u002Fc62b7ad0-304e-4a21-a245-aeee01573342.jpg","2026-10-06T07:51:44.617Z",{"id":62,"type":6,"title":63,"slug":64,"summary":65,"coverUrl":66,"authorName":14,"sno":67,"publishedAt":42,"createdAt":68},"9fa30ea6-8110-41fd-b241-37cd2fd2d55f","Hybrid Logical Clock：没有可靠全球时钟，分布式系统如何记录先后？","hybrid-logical-clock-distributed-ordering","混合逻辑时钟把接近现实的物理时间与逻辑计数结合起来，在不要求全球时钟完美同步的前提下表达因果顺序。","\u002Fuploads\u002F2026-09-26\u002F0bb95ad8-47c0-4ed3-ab8f-421409fff373.jpg",56,"2026-09-26T16:26:31.764Z"]