← 返回刚才阅读的位置

知识卡片

普通读书笔记卡 · 4545.e.6

串联依赖形成可用性短板

理解等级:高级

若请求成功要求全部依赖同时可用,在独立性假设下整体可用性是各项概率的乘积,必不高于任一项。即使后端副本的理想可用性很高,前置单点仍会限制整条链路。原书0.99与0.999999的乘积约为0.98999901,是模型演算,不能当作实测。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • Resilience · 查看原书依据

      Its availability is the product of the availabilities of its components: A s = ∏ 1 N A i When all A i are equal, then this can be simplified to: A s = A N So what if we slapped a dodgy load balancer instance in front of our fancy 99.9999% available set of

    参考来源

    - 位置:《Cloud Native Go》第09章《Resilience》(来源项目book-sources;源文件:extracted/Cloud Native Go (Matthew A. Titmus)/_epub-src/OEBPS/ch09.xhtml) - 结论依据:若请求成功要求全部依赖同时可用,在独立性假设下整体可用性是各项概率的乘积,必不高于任一项。原文相应定义、示例或限制为此结论提供依据;补充纠错与版本边界在正文就近标明。 - 原始内容:Its availability is the product of the availabilities of its components: A s = ∏ 1 N A i When all A i are equal, then this can be simplified to: A s = A N So what if we slapped a dodgy load balancer instance in front of our fancy 99.9999% available set of