- This is a solution to the problem of data clustering in consistent hashing
- Each server is represented by multiple virtual nodes on the ring.
- This makes each server responsible for multiple partitions.
- Then, we find the first virtual node on the ring when trying to determine the key’s location.
- The distribution of keys becomes more balanced as the number of virtual nodes increases. However, more space is needed to store data about virtual nodes.