Question: 4. Considering a circular DHT. The node IDs are shown in the figure below. Assume that each node in the DHT only knows two peers,
4. Considering a circular DHT. The node IDs are shown in the figure below. Assume that each node in the DHT only knows two peers, its immediate successor and its immediate predecessor. [10 points] (a) If Node 13 wants to know who is responsible for Key 1, how many hops does its query message will be transmitted before reaching the peer that is responsible for Key 1? (b) What is an important disadvantage of this approach, given the messages are routed according to the ring topology of the overlay? Describe a method to improve the above disadvantage
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
