Projects / Computer Science / Computer Science project 50

Distributed Key-Value Store with Replication and Leader Election

Approx. component budget: Rs. 0 - 1,500

Objective

Understand how real systems survive failures, and test what happens when machines crash or the network splits.

What you will build

A small database spread over 3 to 5 nodes that keeps copies of data, elects a leader using the Raft idea and keeps working when a node fails.

Results you can expect

• Data survives the crash of 1 node in a 3-node cluster
• A new leader elected in a few seconds
• Read and write throughput
• And results of a network-partition test

What you will learn

Consensus, replication, failure detection, consistency vs availability, and testing distributed systems.

Tools and notes

Go, Rust, Java or Python, gRPC or HTTP, Docker Compose to run nodes. Reading the Raft paper first makes this far easier.

Resume points from this project

• Built and tested Distributed Key-Value Store with Replication and Leader Election; objective: understand how real systems survive failures, and test what happens when machines crash or the network splits.
• Measured and analysed data survives the crash of 1 node in a 3-node cluster and a new leader elected in a few seconds; wrote the report and presented the results in a viva. Add your own numbers: [x].

Replace [x] with your own measured results. Write only what you really did.

More computer science projects

Back to all projects