Data Recovery of Distributed Hash Table with Distributed-to-Distributed Data Copy
Summary :
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 product traceability information with DHTs. In such an application, each entry of a huge number of item-level IDs need to be available on a DHT. To ensure data availability, the soft-state approach has been employed in previous works. However, this does not scale well against the number of entries on a DHT. As we expect 1010 products in the traceability case, the soft-state approach is unacceptable. In this paper, we propose Distributed-to-Distributed Data Copy (D3C). With D3C, users can reconstruct the data as they detect data loss, or even migrate to another DHT system. We show why it scales well against the number of entries on a DHT. We have confirmed our approach with a prototype. Evaluation shows our approach fits well on a DHT with a low rate of failure and a huge number of data entries.
- Publication
- IEICE TRANSACTIONS on Information Vol.E92-D No.10 pp.1999-2006
- Publication Date
- 2009/10/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E92.D.1999
- Type of Manuscript
- Special Section PAPER (Special Section on New Technologies and their Applications of the Internet)
- Category
- Parallel and Distributed Architecture
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yusuke DOI, Shirou WAKAYAMA, Satoshi OZAKI, "Data Recovery of Distributed Hash Table with Distributed-to-Distributed Data Copy" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 10, pp. 1999-2006, October 2009, doi: 10.1587/transinf.E92.D.1999.
Abstract: 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 product traceability information with DHTs. In such an application, each entry of a huge number of item-level IDs need to be available on a DHT. To ensure data availability, the soft-state approach has been employed in previous works. However, this does not scale well against the number of entries on a DHT. As we expect 1010 products in the traceability case, the soft-state approach is unacceptable. In this paper, we propose Distributed-to-Distributed Data Copy (D3C). With D3C, users can reconstruct the data as they detect data loss, or even migrate to another DHT system. We show why it scales well against the number of entries on a DHT. We have confirmed our approach with a prototype. Evaluation shows our approach fits well on a DHT with a low rate of failure and a huge number of data entries.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.1999/_p
Copy
@ARTICLE{e92-d_10_1999,
author={Yusuke DOI, Shirou WAKAYAMA, Satoshi OZAKI, },
journal={IEICE TRANSACTIONS on Information},
title={Data Recovery of Distributed Hash Table with Distributed-to-Distributed Data Copy},
year={2009},
volume={E92-D},
number={10},
pages={1999-2006},
abstract={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 product traceability information with DHTs. In such an application, each entry of a huge number of item-level IDs need to be available on a DHT. To ensure data availability, the soft-state approach has been employed in previous works. However, this does not scale well against the number of entries on a DHT. As we expect 1010 products in the traceability case, the soft-state approach is unacceptable. In this paper, we propose Distributed-to-Distributed Data Copy (D3C). With D3C, users can reconstruct the data as they detect data loss, or even migrate to another DHT system. We show why it scales well against the number of entries on a DHT. We have confirmed our approach with a prototype. Evaluation shows our approach fits well on a DHT with a low rate of failure and a huge number of data entries.},
keywords={},
doi={10.1587/transinf.E92.D.1999},
ISSN={1745-1361},
month={October},}
Copy
TY - JOUR
TI - Data Recovery of Distributed Hash Table with Distributed-to-Distributed Data Copy
T2 - IEICE TRANSACTIONS on Information
SP - 1999
EP - 2006
AU - Yusuke DOI
AU - Shirou WAKAYAMA
AU - Satoshi OZAKI
PY - 2009
DO - 10.1587/transinf.E92.D.1999
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2009
AB - 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 product traceability information with DHTs. In such an application, each entry of a huge number of item-level IDs need to be available on a DHT. To ensure data availability, the soft-state approach has been employed in previous works. However, this does not scale well against the number of entries on a DHT. As we expect 1010 products in the traceability case, the soft-state approach is unacceptable. In this paper, we propose Distributed-to-Distributed Data Copy (D3C). With D3C, users can reconstruct the data as they detect data loss, or even migrate to another DHT system. We show why it scales well against the number of entries on a DHT. We have confirmed our approach with a prototype. Evaluation shows our approach fits well on a DHT with a low rate of failure and a huge number of data entries.
ER -
English
