Routing algorithms choose a next hop according to an estimate of distance in some addressing space. Pastry and Tapestry both use circular linear address spaces in which a function based on the approximate numerical difference between GUIDs determines their separation. Kademlia uses the XOR of the GUIDs. How does this help in the maintenance of routing tables? Does the XOR operation provide appropriate properties for a distance metric?
What will be an ideal response?
The Kademlia paper states that the symmetry of the XOR operation ensures a simple and efficient routing mechanism. It results in symmetric routing tables being which isn’t true for some other routing algorithms. (It is for Pastry, but not for Chord). Symmetry means that nodes can learn new routing information from incoming messages, since the routes they have taken are reversible. In Kademlia the XOR of the GUIDs for the source and destination nodes is treated as a numeric distance metric and this results in a sensibly-behaved distance metric.
You might also like to view...
Wireless networks are more vulnerable to attack than wired networks
Indicate whether the statement is true or false
Assume array items contains the integer values 0, 2, 4, 6 and 8. Which of the following uses the enhanced for loop to display each value in array items?
a. for (int i = 0; i < items.length; i++) { System.out.prinf("%d%n", items[i]); } b. for (int i : items) { System.out.prinf("%d%n", items[i]); } c. for (int i : items) { System.out.prinf("%d%n", i); } d. for (int i = 0 : items.length) { System.out.prinf("%d%n", items[i]); }