CS297 Deliverable 1

Description: I have implemented the famous chord protocol which is based on
consistent hashing to locate the available nodes in the system. It can be used to place other nodes and keys using finger tables in the chord ring

The project makes use of GRPC for communication between multiple nodes

Example Following is the Java implementation with a few example screenshots

1. Run Node.java with a command line argument using the port 9000

2. Start Node on any another port

3. Keep the above nodes running and check their respective info by running Client.java
Below we see finger table for different nodes along with their successors and predecessors

4. Start another node on 9090

5. Enter a few keys to store in the network

6. Check where the key is stored

7. Enter a new node 9090

8.Key 80 gets shifted to 9090 as the new node is added

The project makes use of GRPC for communication between multiple nodes