TY - GEN
T1 - KadRTT
T2 - 20th Annual IFIP Networking Conference, IFIP Networking 2021
AU - Kanemitsu, Hidehiro
AU - Nakazato, Hidenori
N1 - Funding Information:
ACKNOWLEDGMENT The work leading up to this paper has been supported by a gift from Protocol Labs under the grant titled as “RFP 7: Multi-Level DHT Design and Evaluation”.
Publisher Copyright:
© 2021 IFIP.
PY - 2021/6/21
Y1 - 2021/6/21
N2 - 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.
AB - 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.
KW - DHT
KW - Kademlia
KW - libp2p
KW - peer-to-peer
KW - RTT
UR - http://www.scopus.com/inward/record.url?scp=85112838288&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85112838288&partnerID=8YFLogxK
U2 - 10.23919/IFIPNetworking52078.2021.9472816
DO - 10.23919/IFIPNetworking52078.2021.9472816
M3 - Conference contribution
AN - SCOPUS:85112838288
T3 - 2021 IFIP Networking Conference, IFIP Networking 2021
BT - 2021 IFIP Networking Conference, IFIP Networking 2021
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 21 June 2021 through 24 June 2021
ER -