ReCord: A Distributed Hash Table with Recursive Structure

TL;DR

ReCord is a scalable distributed hash table that improves performance and topology maintenance by using a recursive structure, balancing node degree and query latency effectively.

Contribution

It introduces ReCord, a generalized DHT with recursive structure, offering better tradeoffs in performance and maintenance compared to existing P2P systems.

Findings

ReCord achieves $O(rac{ ext{log} n}{ ext{log} ext{log} n})$ hop latency with higher node degree.

ReCord's expected latency is $ heta( ext{log} n)$ with $O( ext{log} n)$ node degree.

Simulations confirm the dynamic behavior and scalability of ReCord.

Abstract

We propose a simple distributed hash table called ReCord, which is a generalized version of Randomized-Chord and offers improved tradeoffs in performance and topology maintenance over existing P2P systems. ReCord is scalable and can be easily implemented as an overlay network, and offers a good tradeoff between the node degree and query latency. For instance, an $n$-node ReCord with $O(\log n)$ node degree has an expected latency of $\Theta(\log n)$ hops. Alternatively, it can also offer $\Theta(\frac{\log n}{\log \log n})$ hops latency at a higher cost of $O(\frac{\log^2 n}{\log \log n})$ node degree. Meanwhile, simulations of the dynamic behaviors of ReCord are studied.