Back to All CourseworkDistributed Computing System
Individual ProjectMar – Apr 2025Interactive Web Demo
Consistent Hashing Distributed Key-Value Ring
A decentralized key-value storage service partitioned across a 1024-position consistent hash ring with dynamic node joining, graceful departures, and key handovers.
My Contribution: I developed the bootstrap coordinator, ring routing logic, and dynamic key range migration.
Live Browser Simulation
Interactive 1024-Node Hash Ring
Client-Side Engine
Try this: Insert keys, add node 434, exit node 650, and watch keys migrate smoothly between successor ranges.
Loading simulation engine...
Architecture verification: Full consistent hashing ring algorithm verified across hundreds of join/leave cycles.
Implementation Highlights
- 1024-position logical ring where keys map to the nearest clockwise active node.
- Dynamic membership: new nodes claim key range (predecessor, id] with atomic handover.
- Graceful node departure: exiting node forwards stored pairs to its successor before sign-off.
- Request routing: query routing through bootstrap index with path tracing.
Algorithm & System Mechanics
- Ring partitioning confines membership churn to adjacent neighbor nodes.
- Key migrations occur only between the entering/exiting node and its immediate successor.