Paper Info
Title
Embracing the Peer Next Door: Proximity in Kademlia
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. This 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. Evaluation with real-world measurement data gives evidence that locality of traffic tends to reduce lookup latencies as well. In turn, mechanisms that aim at reducing lookup latencies do not necessarily reduce cross-network traffic to the same extent.
Year
DOI
Venue
2008
10.1109/P2P.2008.36
Peer-to-Peer Computing
Keywords
Field
DocType
recursive routing algorithm,real-world measurement data,iterative routing algorithm,work leverages location data,next door,hash table,overlay neighbour,lookup latency,proximity neighbour,cross-network traffic,peer next door,iterative algorithm,databases,routing,distributed hash table,kademlia,data models
Data modeling,Locality,Latency (engineering),Computer science,Iterative method,Computer network,Overlay,Kademlia,Recursion,Distributed hash table,Distributed computing
Conference
ISSN
Citations 
PageRank 
2161-3567
17
0.81
References 
Authors
12
4
Name
Order
Citations
PageRank
Sebastian Kaune121412.93
Tobias Lauinger21188.58
Aleksandra Kovacevic330419.93
Konstantin Pussep419513.86