ReCord: A Distributed Hash Table with Recursive Structure
<|reference_start|>ReCord: A Distributed Hash Table with Recursive Structure: 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.<|reference_end|>
@article{zeng2004record:,
    title={ReCord: A Distributed Hash Table with Recursive Structure},
    author={Jianyang Zeng, Wen-Jing Hsu},
    journal={arXiv preprint arXiv:cs/0410074},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0410074},
    primaryClass={cs.DC}
}