Loading content
Consistent hashing maps nodes and keys onto an abstract hash ring. When nodes join or leave, most key-to-node mappings remain unchanged, minimizing remapping. It is commonly used in distributed systems and caching to reduce data movement and rebalancing costs.
Use this profile to understand the building block briefly, place it in the model, and open related building blocks.
Theoretical construct: explains a term, principle, or mental model.
What organizes, connects, or makes decisions possible.
Consistent hashing distributes keys so topology changes move only bounded assignments.
The term was introduced by David Karger and co-authors at MIT. Their 1997 paper introduced consistent hashing for distributed caching, so a changing population of web servers requires only limited reassignment.
Place keys and nodes on a hash ring; a key follows the next node, while virtual nodes smooth load.
It maps hash values to a cyclic neighborhood of responsible nodes.
Multiple ring positions distribute one physical node more evenly.
It reduces data and cache movement during scaling, complemented by replication and recovery strategies.
Where this building block is located in the topic model.
No structure path available.
Explore how this building block connects to concepts, methods, technologies, and tools.
These sources establish the term and its professional meaning.
All direct connections of the current building block in a compact text view.
This classification shows where the building block typically matters, how demanding it is, and what kind of impact it has in the model.
The level within the organization (enterprise, domain, team) at which the AssetBlock is applied.