By Topic

ReCord: A Distributed Hash Table with Recursive Structure

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jianyang Zeng ; Nanyang Technological University, Singapore ; Wen-Jing Hsu

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.

Published in:

Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)

Date of Conference:

05-08 Dec. 2005