Consistent Hashing
A core routing algorithm in distributed systems that maps both nodes and data onto the same hash ring, minimizing the amount of data migration required when nodes are added or removed from the cluster.
Timeline (last 90 days)
The engineering trade-off for stateful long connections is to centrally write connection state into low-latency storage like Redis, which the routing layer queries and then forwards, while using consistent hashing or user-ID-based sharding rules to pin connections to a group of servers.
The opposing ideas of cache affinity and load balancing can be traced back to early practices in Web caching, database partitioning, and CDN scheduling, where cache affinity is often achieved through consistent hashing in traditional scenarios.
Common load balancing algorithms include round robin, least connections, and consistent hashing.
Consistent hashing minimizes data migration when nodes are added or removed, and is a core algorithm in distributed caching and shard routing.
All Facts (4)
The engineering trade-off for stateful long connections is to centrally write connection state into low-latency storage like Redis, which the routing layer queries and then forwards, while using consistent hashing or user-ID-based sharding rules to pin connections to a group of servers.
50%UnverifiedThe opposing ideas of cache affinity and load balancing can be traced back to early practices in Web caching, database partitioning, and CDN scheduling, where cache affinity is often achieved through consistent hashing in traditional scenarios.
50%UnverifiedCommon load balancing algorithms include round robin, least connections, and consistent hashing.
50%UnverifiedConsistent hashing minimizes data migration when nodes are added or removed, and is a core algorithm in distributed caching and shard routing.
50%