Chord Implementation
Status: Alpha
Brought to you by:
morellid
Menu
▾
▴
#1 Chord Implementation
An implementation that allows key/value pairs of abstract objects to be stored in a Chord ring type formation.
Chord nodes are ordered in a ring in increasing order by a unique long integer ID. Each node knows only its successor, predecessor, and a few intermediate nodes around the ring. Values are stored depending on the node's ID that immediately succeeds the key ID.
Replication will also be implemented here.
Development has already begun.
The base implementation is underway. This specific implementation will have one added feature. Since a chord ring is a type of ordered node formation, we will add the ability to route custom messages to certain nodes in the ring. Each node already holds its own ID for content addressing. We will add a "Message" type object to the list of transportable message types, currently being "Put" and "Get", whose functionality is obvious.
The message class can hold any serializable object and has headers for addressing the message to a specific node in the mesh.