0

Consistent Hashing : Save Your Weekends

by Deepak Dhakal 10. August 2019 06:01

Consistent Hashing

 October 9, 2017 Deb Haldar 8 Comments , 

Consistent hashing is one of the techniques used to bake in scalability into the storage architecture of your system from grounds up.

In a distributed system, consistent hashing helps in solving the following scenarios:

  1. To provide elastic scaling (a term used to describe dynamic adding/removing of servers based on usage load) for cache servers.
  2. Scale out a set of storage nodes like NoSQL databases.

It is a very useful concept that frequently comes up in System Design Interviews. You might need to apply the concept while designing the backend of a system to alleviate bottlenecks . You could also be directly asked to design and implement  a consistent hashing algorithm. In this article, we'll look at:

Why do we need Consistent Hashing ?

Imagine that you want to create a scalable database backend with "n" database servers for your web application as depicted by the diagram below. For our simple example, we'll assume that we're just storing a key:value pair like "Country:Canada"in the DBs.

Figure 1: A distributed system with a cluster of database servers

Our goal is to design a database storage system such that:

  1. We should be able to distribute the incoming queries uniformly among the set of "n" database servers
  2. We should be able to dynamically add or remove a database server
  3. When we add/remove a database server, we need to move the minimal amount of data between the servers

So essentially we need to send each piece of incoming query to a  specific server. A simple approach is as follows:

  1. Generate a hash of the key from the incoming data :  " hashValue = HashFunction(Key)"
  2. Figure out the server to send the data to by taking the modulo ("%") of the hashValue using the number of current db servers, n : "serverIndex = hashValue % n"

Let's walk through a simple example.

  • Imagine we have 4 database servers
  • Imagine our hashFunction returns a value from 0 to 7
  • We'll assume that "key0" when passed through our hashFunction, generates a hashvalue or 0, "key1" generates 1 and so on.
  • The serverIndex for "key0" is 0, "key1" is 1 and so on.

The situation assuming that the key data is unfirmly distributed, is depicted in the image below. We receive 8 pieces of data and our hashing algorithm distributes it evenly across our four database servers.

Figure 2: Sharding/ Distributing data across several database servers

Problem solved, right ?  Not quite – there's two major drawbacks with this approach, namely, Horizontal Scalability and Non-Uniform data distribution across servers.

Horizontal Scalability

This scheme is not horizontally scalable. If we add or remove servers from the set, all our existing mappings are broken. This is because the value of "n" in our function that calculates the serverIndex changes. The result is that all existing data needs to be remapped and migrated to different servers. This might be a herculean task because it'll either require a scheduled system downtime to update mappings or creating read replicas of the existing system which can service queries during the migration. In other words, a lot of pain and expenditure.

Here's a quick illustration of what happens when we add another server (server 5)  to the mix. Please refer back to figure 1 for the original key distribution. Notice that we'll need to update 3 out of the original 4 servers – i.e. 75% of servers needs to be updated!

Figure 3: Effect of adding a database server to the cluster

The effect is more drastic when a server goes down as depicted below. In this case, we'll need to update ALL servers, i.e.,100% of servers needs to be updated !

Figure 4: Effect of removing a server from the database cluster

Data Distribution – Avoiding  "Data Hot Spots" in Cluster

We cannot expect uniform distribution of data coming in all the time. There may be many more keys whose hashValue maps to server number 3 than any other servers , in which case server number 3 will become a hotspot for queries.

Consistent hashing allows up to solve both these problems. Read on to find out how !

How does Consistent Hashing Work ?

Consistent hashing facilitates the distribution of data across a set of nodes in such a way that minimizes the re-mapping/ reorganization of data when nodes are added or removed. Here's how it works:

1. Creating the Hash Key Space: Consider we have a hash function that generates integer hash values in the range [0,  2^32-1)

We can represent this as an array of integers with 2^32 -1 slots. We'll call the first slot x0 and the last slot xn – 1

Figure 5: A Hash Key Space 

2. Representing the hashSpace as a Ring: Imagine that these integers generated in step # 2 is placed on a ring such that the last value wraps around.

Figure 6: Visualizing the hash key space as a Ring

3. Placing DB Servers in Key Space (HashRing): We're given a list of database servers to start with. Using the hash function, we map each db server to a specific place on the ring. For example, if we have 4 servers, we can use a hash of their IP addressed to map them to different integers using the hash function. This simulates placing the four servers into a different place on the ring as shown below.

Figure 7: Placing database servers on a hash ring

  1. Determining Placement of Keys on Servers: To find which database server an incoming key resides on (either to insert it or query for it ), we do the following:
  • Run the key through the same hash function we used to determine db server placement on the ring.​
  • After hashing the key, we'll get an integer value which will be contained in the hash space, i.e., it can be mapped to some postion in the hash ring. There can be two cases:
  1. The hash value maps to a place on the ring which does not have a db server. In this case, we travel clockwise on the ring from the point where the key mapped to untill we find the first db server. Once we find the first db server travelling clockwise on the ring, we insert the key there. The same logic would apply while trying to find a key in the ring.
  2. The hash value of the key maps directly onto the same hash vale of a db server – in which case we place it on that server.

Example: Assume we have 4 incoming keys : key0, key1, key2, key3 and none of them directly maps to the hash value of any of the 4 servers on our hash ring. So we travel clockwise from the point these keys maps to in our ring till we find the first db server and insert the key there. This is depicted in Figure 7 below.

Figure 8: Key placements on database servers in a hash ring

5. Adding a server to the Ring: If we add another server to the hash Ring, server 4, we'll need to remap the keys. However, ONLY the keys that reside between server 3 and server 0 needs to be remapped to server 4. On an average , we'll need to remap only k/n keys , where k is the number of keys and n is the number of servers. This is in sharp contrast to our modulo based placement approach where we needed to remap nearly all the keys.

The figure below shows the effect of inserting a new server4 – since server 4 now resides between key0 and server0, key0 will be remapped from server0 to server4.

Figure 9: Effect of adding a server to the hash ring

6. Removing a server from the ring: A server might go down in production and our consistent hashing scheme ensures that it has minimal effect on the number of keys and servers affected.

As we can see in the figure below, if server0 goes down, only the keys in between server3 and server 0 will need to be remapped to server 1( the area is circled in yellow). The rest of the keys are unaffected .

Figure 10: Effect of removing a server from the hash ring

At this point, consistent hashing has  successfully solved the horizontal scalability problem by ensuring that every time we scale up or down, we DO NOT have to re-arrange all the keys or touch all the database servers !

But what about the distribution of data across the various database servers? We can run into a situation where our server distribution across the hash ring is non uniform , i.e., the size of partitions each server is responsible for is not the same. But you might ask how will that happen ? Well, imagine that we started off with 3 servers (server0, server1, server2) that were more or less evenly distributed across the ring. If one of the servers fail, then the load seen by the server immediately following the failed server will be higher. This is assuming all the data that comes in has a uniform key distribution. In reality , the issue is more complicated because data does not have uniform distribution in most cases. So these two things coupled together can lead to a situation like the one shown below. Here, server0 is seeing a very high load because :

  1. Data was non-uniformly distributed to start with – so server2 was having a lot of hot spots
  2. Server2 eventually fails and had to be removed from the hash ring. (note that server 0 now gets all of server2's keys)

Figure 11: Keys can be non-uniformly distributed across servers in a hash ring

So how do we solve this ?

It turns out that there is a pretty standard solution to the problem. It involves the introduction of a number of replicas or virtual nodes for each server across the ring. For example,

Server 0 might have two replicas placed at different points across the ring.

Figure 12: Using Virtual Nodes to assign increase the key space covered by each server

But how does using replicas make the key distribution more uniform ? Here's a visual example – Figure 13 shows the key distribution with two serevers in the hash ring WITHOUT replicas. We can observe that server 0 is handling 100% of the keys.

Figure 13: Non-uniform key distribution in absence of replication of nodes in a hash ring

If we introduce one more replica of each server on the ring , then the key distribution looks like the one in figure 14. Now server0 is responsible for 50% ( 2 out of 4) keys and server 1 is responsible for the other 50% of the keys.

Figure 14: Using virtual nodes/ replication to create better key distribution in a hash ring

As the number of replicas or virtual nodes in the hash ring increase, the key distribution becomes more and more uniform. In real systems, the number of virtual nodes / replicas is very large (>100) .

At this point, Consistent Hashing has successfully solved the problem of non-uniform data distribution (hot spots) across our database server cluster.

Key things to remember about Consistent Hashing for System Design Interviews

SCENARIOS WHERE TO USE CONSISTENT HASHING

  1. You have a cluster of databases and you need to elastically scale them up or down based on traffic load. For example, add more servers during Christmas to handle the the extra traffic.
  2. You have a set of cache servers that need to elastically scale up or down based on traffic load.

BENEFITS OF CONSISTENT HASHING:

  1. Enables Elastic Scaling of cluster of database/cache servers
  2. Facilitates Replication and partitioning of data across servers
  3. Partitioning of data enables uniform distribution which relieves hot spots
  4. Points a-c enables higher availability of the system as a whole.

Implementation Consistent Hashing

Please note that this is for purely illustrative purposes only. There are no guarantees for robustness or stability if used in production code.

There are three key pieces we need to implement:

  1. A Hash table like data structure which can simulate the key space or the hash Ring. In our case, we'll use a SortedDictionary in C#
  2. A hash function that can generate a integer value for the servers ip address and incoming keys we need to map to the hash ring
  3. The server object themselves.

First we define a server class which basically encapsulates an ip address and represent a physical server.

  1. using System.Collections.Generic;
  2. using System.Linq;
  3. using System.Text;
  4. using System.Threading.Tasks;
  6. namespace ConsistentHashing
  7. {
  8. class Server
  9. {
  10. public String ipAddress;
  12. public Server(String ipAddress)
  13. {
  14. this.ipAddress = ipAddress;
  15. }
  16. }
  17. }

Next we define the hash function which will return an integer value for server ips and the keys.

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  5. using System.Threading.Tasks;
  6. /*
  7. * This code is taken from the stackoverflow article:
  8. * https://stackoverflow.com/questions/12272296/32-bit-fast-uniform-hash-function-use-md5-sha1-and-cut-off-4-bytes
  9. */
  10. namespace ConsistentHashing
  11. {
  12. public static class FNVHash
  13. {
  14. public static uint To32BitFnv1aHash(string toHash, bool separateUpperByte = false)
  15. {
  16. IEnumerable<byte> bytesToHash;
  18. if (separateUpperByte)
  19. bytesToHash = toHash.ToCharArray()
  20. .Select(c => new[] { (byte)((c - (byte)c) >> 8), (byte)c })
  21. .SelectMany(c => c);
  22. else
  23. bytesToHash = toHash.ToCharArray()
  24. .Select(Convert.ToByte);
  26. //this is the actual hash function; very simple
  27. uint hash = FnvConstants.FnvOffset32;
  29. foreach (var chunk in bytesToHash)
  30. {
  31. hash ^= chunk;
  32. hash *= FnvConstants.FnvPrime32;
  33. }
  35. return hash;
  36. }
  37. }
  38. public static class FnvConstants
  39. {
  40. public static readonly uint FnvPrime32 = 16777619;
  41. public static readonly ulong FnvPrime64 = 1099511628211;
  42. public static readonly uint FnvOffset32 = 2166136261;
  43. public static readonly ulong FnvOffset64 = 14695981039346656037;
  44. }
  45. }

Finally, we define the consistent hash class which enacpsulates the logic for :

  1. Creating the hash ring
  2. Adding a server to the hash ring
  3. Removing a server from the hash ring
  4. Getting the location of the server on the hash ring where a key needs to be added / retrieved from.
  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  5. using System.Threading.Tasks;
  7. namespace ConsistentHashing
  8. {
  9. class ConsistentHash
  10. {
  11. private SortedDictionary<uint, Server> hashRing;
  12. private int numberOfReplicas; // The number of virtual nodes
  14. public ConsistentHash(int numberOfReplicas, List<Server> servers)
  15. {
  16. this.numberOfReplicas = numberOfReplicas;
  18. hashRing = new SortedDictionary<uint, Server>();
  20. if(servers != null)
  21. foreach(Server s in servers)
  22. {
  23. this.addServerToHashRing(s);
  24. }
  25. }
  27. public void addServerToHashRing(Server server)
  28. {
  29. for(int i=0; i < numberOfReplicas; i++)
  30. {
  31. //Fuse the server ip with the replica number
  32. string serverIdentity = String.Concat(server.ipAddress, ":", i);
  33. //Get the hash key of the server
  34. uint hashKey = FNVHash.To32BitFnv1aHash(serverIdentity);
  35. //Insert the server at the hashkey in the Sorted Dictionary
  36. this.hashRing.Add(hashKey, server);
  37. }
  38. }
  40. public void removeServerFromHashRing(Server server)
  41. {
  42. for (int i = 0; i < numberOfReplicas; i++)
  43. {
  44. //Fuse the server ip with the replica number
  45. string serverIdentity = String.Concat(server.ipAddress, ":", i);
  46. //Get the hash key of the server
  47. uint hashKey = FNVHash.To32BitFnv1aHash(serverIdentity);
  48. //Insert the server at the hashkey in the Sorted Dictionary
  49. this.hashRing.Remove(hashKey);
  50. }
  51. }
  53. // Get the Physical server where a key is mapped to
  54. public Server GetServerForKey(String key)
  55. {
  56. Server serverHoldingKey;
  58. if(this.hashRing.Count==0)
  59. {
  60. return null;
  61. }
  63. // Get the hash for the key
  64. uint hashKey = FNVHash.To32BitFnv1aHash(key);
  66. if(this.hashRing.ContainsKey(hashKey))
  67. {
  69. serverHoldingKey = this.hashRing[hashKey];
  70. }
  71. else
  72. {
  73. uint[] sortedKeys = this.hashRing.Keys.ToArray();
  75. //Find the first server key greater than the hashkey
  76. uint firstServerKey = sortedKeys.FirstOrDefault(x => x >= hashKey);
  78. // Get the Server at that Hashkey
  79. serverHoldingKey = this.hashRing[firstServerKey];
  80. }
  82. return serverHoldingKey;
  83. }
  85. }
  86. }

Finally, here's a test program which exercises the functionality of the above code.

  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  5. using System.Threading.Tasks;
  6. using System.Security.Cryptography;
  8. namespace ConsistentHashing
  9. {
  10. class Program
  11. {
  12. static void Main(string[] args)
  13. {
  14. List<Server> rackServers = new List<Server>();
  15. rackServers.Add(new Server("10.0.0.1"));
  16. rackServers.Add(new Server("10.0.0.2"));
  18. int numberOfReplicas = 1;
  20. ConsistentHash serverDistributor = new ConsistentHash(numberOfReplicas, rackServers);
  22. //add a new server to the mix
  23. Server newServer = new Server("10.0.0.3");
  24. serverDistributor.addServerToHashRing(newServer);
  26. //Assume you have a key "key0"
  27. Server serverForKey = serverDistributor.GetServerForKey("key0");
  28. Console.WriteLine("Server: " + serverForKey.ipAddress + " holds key: Key0");
  30. // Now remove a server
  31. serverDistributor.removeServerFromHashRing(newServer);
  32. // Now check on which server "key0" landed up
  33. serverForKey = serverDistributor.GetServerForKey("key0");
  34. Console.WriteLine("Server: " + serverForKey.ipAddress + " holds key: Key0");
  36. }
  37. }
  38. }

OUTPUT:

  1. Server: 10.0.0.3 holds key: Key0
  2. Server: 10.0.0.2 holds key: Key0

Consistent Hashing in Action in Production Systems

There are a number of live systems which use consistent hashing including:

Further Reading On Consistent Hashing

1. Tom White's article on Consistent Hashing is the one i used to initially learn about this technique. The C# implementation in this article is loosely based on his java implementation.

2. Tim Berglund's Distributed System in One Lesson is a fantastic resource to learn about read replication, sharding and consistent hashing. Unfortunately, you'll need a safari membership for this.

3. David Karger and Eric Lehman's original paper on Consistent Hashing

4. David Karger and Alex Sherman's paper on Web Caching with Consistent Hashing

If you have any feedback, please add it to the comment section below. And if you enjoyed the article, please share it on your favorite social media platform 🙂

Tags: ,

E-mail | Kick it! | DZone it! | del.icio.us
Permalink | Comments (0) | Post RSSRSS comment feed

Powered by BlogEngine.NET 1.5.0.7
Original Design by Laptop Geek, Adapted by onesoft