Blockchains have become the catalyst for a growing movement to create a more decentralized Internet. A fundamental operation of applications in a decentralized Internet is data storage and retrieval. As today's blockchains are limited in their storage functionalities, in recent years a number of peer-to-peer data storage networks have emerged based on the Kademlia distributed hash table protocol. However, existing Kademlia implementations are not efficient enough to support fast data storage and retrieval operations necessary for (decentralized) Web applications. In this paper, we present Kadabra, a decentralized protocol for computing the routing table entries in Kademlia to accelerate lookups. Kadabra is motivated by the multi-armed bandit problem, and can automatically adapt to heterogeneity and dynamism in the network. Experimental results show Kadabra achieving between 15-50% lower lookup latencies compared to state-of-the-art baselines.

翻译：屏障链已成为日益扩大的建立更分散的互联网运动的催化剂。在分散的互联网中,应用的基本操作是数据存储和检索。由于今天的屏障链的存储功能有限,近年来,根据卡迪姆利亚分发的散装散列表格协议,出现了一些同侪数据存储网络。然而,现有的卡迪姆利亚实施不够有效,不足以支持(分散的)网络应用程序所需的快速数据存储和检索操作。在本文件中,我们介绍了卡达布拉(Kadabra),这是计算卡迪姆利亚的定线表条目以加速查勘的分散协议。卡达布拉(Kadabra)受多臂强盗问题的驱动,可以自动适应网络的异质性和活力。实验结果表明,卡达布拉(Kadambra)的查勘时间比最新基线低15-50%。