IEICE TRANSACTIONS on Communications
A Dynamic-Clustering Backup Scheme for High-Availability Distributed File Sharing Systems
Summary :
DHT routing algorithms can provide efficient mechanisms for resource placement and lookup for distributed file sharing systems. However, we must still deal with irregular and frequent join/leave of nodes and the problem of load unbalancing between nodes in DHT-based file sharing systems. This paper presents an efficient file backup scheme based on dynamic DHT key space clustering in order to guarantee data availability and support load balancing. The main idea of our method is to dynamically divide the DHT network into a number of clusters, each of which locally stores and maintains data chunks of data files to guarantee the data availability of user data files even when node churn occurs. Further, high-capacity nodes in clusters are selected as backup nodes to achieve adequate load balancing. Simulation results demonstrate the superior effectiveness of the proposed scheme over other file replication schemes.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E102-B No.3 pp.545-556
- Publication Date
- 2019/03/01
- Publicized
- 2018/09/10
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2018EBP3108
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Hoai Son NGUYEN
VNU-University of Engineering and Technology
Dinh Nghia NGUYEN
VNU-University of Engineering and Technology,People Security Academy
Shinji SUGAWARA
Chiba Institute of Technology
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
Hoai Son NGUYEN , Dinh Nghia NGUYEN, Shinji SUGAWARA, "A Dynamic-Clustering Backup Scheme for High-Availability Distributed File Sharing Systems" in IEICE TRANSACTIONS on Communications,
vol. E102-B, no. 3, pp. 545-556, March 2019, doi: 10.1587/transcom.2018EBP3108.
Abstract: DHT routing algorithms can provide efficient mechanisms for resource placement and lookup for distributed file sharing systems. However, we must still deal with irregular and frequent join/leave of nodes and the problem of load unbalancing between nodes in DHT-based file sharing systems. This paper presents an efficient file backup scheme based on dynamic DHT key space clustering in order to guarantee data availability and support load balancing. The main idea of our method is to dynamically divide the DHT network into a number of clusters, each of which locally stores and maintains data chunks of data files to guarantee the data availability of user data files even when node churn occurs. Further, high-capacity nodes in clusters are selected as backup nodes to achieve adequate load balancing. Simulation results demonstrate the superior effectiveness of the proposed scheme over other file replication schemes.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2018EBP3108/_p
Copy
@ARTICLE{e102-b_3_545,
author={Hoai Son NGUYEN , Dinh Nghia NGUYEN, Shinji SUGAWARA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Dynamic-Clustering Backup Scheme for High-Availability Distributed File Sharing Systems},
year={2019},
volume={E102-B},
number={3},
pages={545-556},
abstract={DHT routing algorithms can provide efficient mechanisms for resource placement and lookup for distributed file sharing systems. However, we must still deal with irregular and frequent join/leave of nodes and the problem of load unbalancing between nodes in DHT-based file sharing systems. This paper presents an efficient file backup scheme based on dynamic DHT key space clustering in order to guarantee data availability and support load balancing. The main idea of our method is to dynamically divide the DHT network into a number of clusters, each of which locally stores and maintains data chunks of data files to guarantee the data availability of user data files even when node churn occurs. Further, high-capacity nodes in clusters are selected as backup nodes to achieve adequate load balancing. Simulation results demonstrate the superior effectiveness of the proposed scheme over other file replication schemes.},
keywords={},
doi={10.1587/transcom.2018EBP3108},
ISSN={1745-1345},
month={March},}
Copy
TY - JOUR
TI - A Dynamic-Clustering Backup Scheme for High-Availability Distributed File Sharing Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 545
EP - 556
AU - Hoai Son NGUYEN
AU - Dinh Nghia NGUYEN
AU - Shinji SUGAWARA
PY - 2019
DO - 10.1587/transcom.2018EBP3108
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E102-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2019
AB - DHT routing algorithms can provide efficient mechanisms for resource placement and lookup for distributed file sharing systems. However, we must still deal with irregular and frequent join/leave of nodes and the problem of load unbalancing between nodes in DHT-based file sharing systems. This paper presents an efficient file backup scheme based on dynamic DHT key space clustering in order to guarantee data availability and support load balancing. The main idea of our method is to dynamically divide the DHT network into a number of clusters, each of which locally stores and maintains data chunks of data files to guarantee the data availability of user data files even when node churn occurs. Further, high-capacity nodes in clusters are selected as backup nodes to achieve adequate load balancing. Simulation results demonstrate the superior effectiveness of the proposed scheme over other file replication schemes.
ER -
English
