KadRTT: Routing with network proximity and uniform ID arrangement in Kademlia

Distributed Hash Table (DHT) has been widely applied to peer-to-peer (P2P) applications for efficient content lookup mechanisms. IPFS, one of the distributed systems for sharing files, websites, and data on a worldwide scale, adopts Kademlia as one of the DHTs, that is included in libp2p on the netw...

Full description

Saved in:
Bibliographic Details
Main Authors: Kanemitsu, Hidehiro, Nakazato, Hidenori
Format: Conference Proceeding
Language:English
Subjects:
Concurrent computing
DHT
Distributed databases
Kademlia
libp2p
peer-to-peer
Peer-to-peer computing
Resilience
Routing
RTT
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Distributed Hash Table (DHT) has been widely applied to peer-to-peer (P2P) applications for efficient content lookup mechanisms. IPFS, one of the distributed systems for sharing files, websites, and data on a worldwide scale, adopts Kademlia as one of the DHTs, that is included in libp2p on the network layer of IFPS. Though DHT-based content lookup can scale in the number of peers, how to control lookup performance, e.g., lookup latency and lookup hop count, is one of the issues for a very large-scale network. Thus, it is necessary to guarantee both the lookup latency and the hop count even if the network scale becomes larger. In this paper, we propose a Kademlia alternative, called KadRTT, that reduces both the lookup latency and hop count. KadRTT has two functionalities, i.e., (i) RTT-based lookup target selection not to increase the maximum hop count, and (ii) uniform ID arrangement for each k-bucket to shorten the initial ID distance from content ID. Experimental results by the simulation show that KadRTT outperforms other Kademlia-based DHTs in terms of lookup latency and hop count.
ISSN:1861-2288
DOI:10.23919/IFIPNetworking52078.2021.9472816