知识卡片

普通读书笔记卡 · 5377.g

DHT以覆盖网络路由

理解等级:中级

分布式哈希表DHT在N个节点上组织覆盖网络,本章给出的路由规模是log(N)跳,用结构化节点连接寻找目标位置。它解决分布式定位问题,区别于给每个请求选后端的入口负载均衡。这里只保留路由目标与量级概念,不从简短定义补造具体一致性、故障恢复或哈希算法。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 宏观架构导论 · 查看原书依据

      Distributed hash tables DHTs): Create an efficient overlay network connecting N nodes to provide routing with log(N) hops. Although DHTs are used as part of the system, no widely used production-grade implementations are available.

    参考来源

    - 位置:《Software Architecture and Decision-Making》第5章《宏观架构导论》(来源项目:book-sources;源文件:extracted/Software Architecture and Decision-Making Leveraging Leadership, Technology, and Product Management to Build Great Products… (Srinath Perera)/_epub-src/ch05.xhtml) - 结论依据:原文的定义、比较或例子支持“分布式哈希表DHT在N个节点上组织覆盖网络,本章给出的路由规模是log(N)跳,用结构化节点连接寻找目标位置”;正文据此说明用途和边界。 - 原始内容:Distributed hash tables DHTs): Create an efficient overlay network connecting N nodes to provide routing with log(N) hops. Although DHTs are used as part of the system, no widely used production-grade implementations are available.