Consistent hash distributions are a simple and proven distribution for what is otherwise an extremely tricky distributed systems problem: distributing stateful objects uniquely over a network in a fashion that is easy to predict AND simple to execute.

In this video we go over the math involved behind making consistent hash distributions, use a simple example from the Akka.NET project, and talk about why consistent hash distributions work so well in practice.

Sample: https://gist.github.com/Aaronontheweb...
Blog Post (2016): https://petabridge.com/blog/akkaclust...

Make sure you subscribe to catch our video about Akka.Cluster.Sharding, which uses consistent hashing and solves the problem of re-partitioning very elegantly!

(0:00) Intro
(0:30) What Problem Does CH Solve?
(1:41) Challenges
(2:57) Bad Solutions
(5:00) Consistent Hashing Requirements
(7:10) What Makes a Hash Function Consistent?
(9:26) How Consistent Hash Distributions Work
(11:56) Visualizing a Distribution w/ Data
(16:08) Re-Partitioning