In a Chord ring using m = 8, nodes with the following peer ids (or node ids) joi

Question

In a Chord ring using m = 8, nodes with the following peer ids (or node ids) join the system: 45, 32, 132, 234, 99, 199. When all finger tables and successors have converged, what is the comma separated list of nodes traversed by a query originating from node 45 intended for the key 12 (include both originating node and final node)? Use the text box below to enter your answer as a sequence of numeric values with each numeric value separated by a comma. Please ensure you enter the node ids in the order traversed, and include both starting and ending nodes in the sequence.

Explanation / Answer

In the need to find the Node for Key 12. We see that out of all the Nodes, Node 32 is the smallest such that its identifier (32) is <= Key.
So starting from Node 45, we find the highest node that can be reached is 132. From NOde 132, highest node that can be reached is 199. From Node 199, the highest node that can be reached is 32.

We need to make that the finger tables for all the nodes in order to see the highest possible node that can be traversed.

So the path followed:

45,132,199,32

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.