In this experiment, we study consistent hashing. To this end, we allow the student user to control parameters such as the number of machines to be used to store objects, the number of objects to store, and also control the churn in the system by allowing the user to add or remove machines. In this setting, the intent is to study the load and balance achieved by the distributed hash table and compare these with the ideal scenario of uniform load.