ReCord: A Distributed Hash Table with Recursive Structure

Details ReCord: A Distributed Hash Table with Recursive Structure ReCord: A Distributed Hash Table with Recursive Structure

2004-10-29

arxiv.org/abs/cs/0410074v2

Computer Science

Distributed, Parallel, and Cluster Computing

16 pages, 7 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

ReCord: A Distributed Hash Table with Recursive Structure does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with ReCord: A Distributed Hash Table with Recursive Structure, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and ReCord: A Distributed Hash Table with Recursive Structure will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-479591