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...
________ in Windows 8 is (are) better than any prior version of Windows
A) GUI B) Menus C) Icons D) Speech recognition
Macros can be run from the Developer tab
Indicate whether the statement is true or false
The U.S. Patriot Act specifically deals with cyberterrorism
Indicate whether the statement is true or false.
A technician pings 127.0.0.1 and gets the following result: Unable to contact IP driver, error code 2.Which of the following would resolve this?
A. Flush the DNS Cache. B. Install NetBEUI. C. Release the IP Address. D. Install the TCP/IP protocol