Embracing the Peer Next Door: Proximity in Kademlia
Key: KLKP08-1
Author: Sebastian Kaune, Tobias Lauinger, Aleksandra Kovacevic, Konstantin Pussep
Date: September 2008
Kind: In proceedings
Publisher: IEEE Computer Society Press
Book title: 8th International Conference on Peer-to-Peer Computing 2008 (P2P '08)
Abstract: At present, the probability of selecting ``the peer next door'' as an overlay neighbour in Kademlia is fairly small. Prior research has been concerned with reducing the lookup latency by means of proximity neighbour and route selection, but focused on recursive routing algorithms. We find that evaluation with real-world measurement data gives evidence that locality of traffic also tends to reduce lookup latencies; therefore our work leverages location data about peers and extends Kademlia's iterative routing algorithm to reduce cross-network traffic at the level of the distributed hash table. In turn, mechanisms that aim at reducing lookup latencies do not necessarily reduce cross-network traffic to the same extent.
View Full paper (PDF) | Download Full paper (PDF)

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, not withstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.