Re:Intro to Distributed Hash Tables
by newlog on Saturday November 15, 2014 @04:49PM
(#8612761)
hey!
First of all, awesome explanation, thanks!
What I didn't understand from your explanation (I don't know if it's explained or if I missed it) is how you identify which node has the value for the key K when the keys are not in the Bs domain. How do you know where to stop the search? What if you have gone to a further node?
First of all, awesome explanation, thanks!
What I didn't understand from your explanation (I don't know if it's explained or if I missed it) is how you identify which node has the value for the key K when the keys are not in the Bs domain. How do you know where to stop the search? What if you have gone to a further node?
I'd be very grateful if you can clarify that :)