Title :
R/Kademlia: Recursive and topology-aware overlay routing
Author_Institution :
Inst. of Telematics, Karlsruhe Inst. of Technol. (KIT), Karlsruhe, Germany
fDate :
Oct. 31 2010-Nov. 3 2010
Abstract :
Structured peer-to-peer overlays offer a basis for a broad range of applications, such as distributed storage, application layer multicast, and mobility support. This paper introduces R/Kademlia, a low bandwidth and low latency variant of the popular overlay protocol Kademlia. R/Kademlia utilizes recursive overlay routing instead of iterative lookups of keys, thus a higher routing performance can be achieved in network scenarios with churn rates that are characteristic for public KAD networks. Both Proximity Routing and Proximity Neighbor Selection are effectively applicable, which leads to a further decrease of routing latencies. Similar to the original protocol, nodes in a R/Kademlia network meet other nodes during user-triggered routing procedures, hence no expensive periodic tasks are needed. For the simulative evaluation of R/Kademlia, the Performance vs. Cost framework (PVC) and the overlay framework OverSim were employed, where both routing modes-iterative and recursive-were simulated and compared in different network scenarios with varying churn rates.
Keywords :
peer-to-peer computing; routing protocols; telecommunication network topology; OverSim overlay framework; R/Kademlia network; application layer multicast; churn rate; distributed storage; low bandwidth; low latency; mobility support; overlay protocol; peer-to-peer overlay; performance-vs-cost framework; proximity neighbor selection; proximity routing; public KAD network; recursive overlay routing; routing latency; routing performance; topology-aware overlay routing; Bandwidth; Maintenance engineering; Measurement; Network topology; Peer to peer computing; Protocols; Routing;
Conference_Titel :
Telecommunication Networks and Applications Conference (ATNAC), 2010 Australasian
Conference_Location :
Auckland
Print_ISBN :
978-1-4244-8173-6
Electronic_ISBN :
978-1-4244-8171-2
DOI :
10.1109/ATNAC.2010.5680244