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

Hidehiro Kanemitsu, Hidenori Nakazato

研究成果: Conference contribution

抄録

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.

本文言語English
ホスト出版物のタイトル2021 IFIP Networking Conference, IFIP Networking 2021
出版社Institute of Electrical and Electronics Engineers Inc.
ISBN(電子版)9783903176393
DOI
出版ステータスPublished - 2021 6 21
イベント20th Annual IFIP Networking Conference, IFIP Networking 2021 - Virtual, Espoo, Finland
継続期間: 2021 6 212021 6 24

出版物シリーズ

名前2021 IFIP Networking Conference, IFIP Networking 2021

Conference

Conference20th Annual IFIP Networking Conference, IFIP Networking 2021
国/地域Finland
CityVirtual, Espoo
Period21/6/2121/6/24

ASJC Scopus subject areas

  • コンピュータ ネットワークおよび通信
  • コンピュータ サイエンスの応用
  • 情報システムおよび情報管理
  • ハードウェアとアーキテクチャ

フィンガープリント

「KadRTT: Routing with network proximity and uniform ID arrangement in Kademlia」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル