By Topic

A Design for Distributed Backup and Migration of Distributed Hash Tables

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

3 Author(s)
Yusuke Doi ; Corp. R&D Center, TOSHIBA Corp., Kawasaki ; Shirou Wakayama ; Satoshi Ozaki

To realize huge-scale information services, many Distributed Hash Table (DHT) based systems have been proposed. For example, there are some proposals to manage item-level RFID information with DHT In such services, service reliability is important. A DHT service is believed to be highly reliable because it is distributed. However, even if the entire service does not stop, the risk of data loss is unavoidable because a DHT consists of many physical nodes. Clearly, in order to avoid compromising the scalability of a DHT-based service, a scalable backup and loss-recovery scheme is required. To solve the problem, we propose a framework of distributed-to-distributed data copy. The proposed design utilizes the distributed manner of DHT algorithms, and it enables coping from a distributed system to a DHT system with minimal bottlenecks.

Published in:

Applications and the Internet, 2008. SAINT 2008. International Symposium on

Date of Conference:

July 28 2008-Aug. 1 2008