akka/akka-core

Use Rendezvous hashing instead of consistent hashing

Open

#17,247 建立於 2015年4月21日

在 GitHub 查看
 (8 留言) (0 反應) (0 負責人)Scala (13,277 star) (3,547 fork)batch import
3 - in progresshelp wantedt:cluster

描述

See https://en.wikipedia.org/wiki/Rendezvous_hashing

  • it is simpler, does not need virtual nodes or a ring at all
  • rebalances are uniform independently of node removal or addition
  • more flexible, for example allows consistently hashed groups, not just single nodes

It is a very nice pattern, I think we can have other good uses for it in the future.

(details on why it is better: https://en.wikipedia.org/wiki/Rendezvous_hashing#Comparison_With_Consistent_Hashing)

貢獻者指南

技術棧
scala
領域
backend
議題類型
feature
難度面向新貢獻者的預計實作難度，1 表示很小改動，5 表示專家級工作。
4
預計時間有經驗貢獻者完成調查、實作、測試並準備 pull request 的粗略時間範圍。
over 1 week
活動狀態議題目前的可參與程度：新鮮、活躍、陳舊、阻塞或等待維護者輸入。
stale
清晰度議題是否清楚說明預期改動、驗收標準和下一步。
mostly clear
前置要求
ScalaAkka internalsconsistent hashing
新手友善度1-100 的估計分數，表示該議題對首次貢獻者的友善程度。
20
研究方向
Review the existing consistent hashing implementation in Akka's routing or cluster module (likely in akka routing or akka cluster). Understand the current ring structure and virtual nodes. Then study the rendezvous hashing algorithm from the provided Wikipedia links. Propose a design that replaces the current implementation with rendezvous hashing, ensuring uniform rebalancing. Note that the issue is open since 2015 with no PRs, so any contribution would need to start from scratch.