Chord algorithm - how to map nodes to keys? [closed]

I'm trying to understand Chord algorithm (for Peer-to-Peer systems) but I can't understand how it maps the documents to the nodes.

I have one example where we have:

• keys with 4 bits
• 5 active nodes with the following identifiers: 1, 5, 7, 10, 13

After mapping the documents to the nodes, we have:

Key 0 - Node 1

Key 2 - Node 5

Key 8 - Node 10

Key 11 - Node 13

Key 15 - Node 1

If somebody could help me with the steps that lead to this results I'd be truly grateful.

• Welcome to CS.SE! What research have you done? What resources have you read? Chord is described in a bunch of places. – D.W. Jan 17 '17 at 0:51

NodeID = KeyID % N