I'm currently reading about the Pastry overlay network and I was wondering how the data was stored at each node? But I can't seem to find anyone writing how the actual data ( not the nodes ) are found.
My current understanding:
Data say image.jpg is hashed to get some kind of key K hash(image.jpg) = a2
Each Node in the overlay network has some unique GUID and the nodes with the most similar GUID are closer to each other physically (since it's structured).
If we say that We have a1(GUID for a node), b3, c2. The algorithm then assigns a2 (the key to the data) to the Node that has the closest GUID, which would be a1.
When one node, say c2, wants to find the data at key (a2) it does the usual algorithm looking at the prefixes to find the node with a GUID closest to the key a2, which would be a1.
But what happens next? Is there another hash table mapping each data key to the data value in each node beside the routing table?
与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…