Question: QUESTION 1 (a) Explain how distributed hash tables work. Detail an example containing 16 nodes. Be sure to create finger tables for at least 2
QUESTION 1
(a) Explain how distributed hash tables work. Detail an example containing 16 nodes. Be sure to create finger tables for at least 2 example nodes using the formula: (p + 2i-1 ) mod 2m
(b) Describe a disadvantage of using finger tables and suggest a possible solution.
(c) You are tasked with selecting a name resolution method for your Distributed System in which entities may periodically change location. Which method would be most appropriate to use? Justify your choice, describing its key features and detailing any possible disadvantages.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
