The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Algoritmos de roteamento DHT podem fornecer mecanismos eficientes para posicionamento de recursos e pesquisa para sistemas distribuídos de compartilhamento de arquivos. No entanto, ainda devemos lidar com a junção/saída irregular e frequente de nós e o problema de desequilíbrio de carga entre nós em sistemas de compartilhamento de arquivos baseados em DHT. Este artigo apresenta um esquema eficiente de backup de arquivos baseado em clustering dinâmico de espaço de chaves DHT para garantir a disponibilidade de dados e suportar balanceamento de carga. A ideia principal do nosso método é dividir dinamicamente a rede DHT em vários clusters, cada um dos quais armazena e mantém localmente blocos de dados de arquivos de dados para garantir a disponibilidade de dados dos arquivos de dados do usuário, mesmo quando ocorre rotatividade de nós. Além disso, nós de alta capacidade em clusters são selecionados como nós de backup para obter balanceamento de carga adequado. Os resultados da simulação demonstram a eficácia superior do esquema proposto em relação a outros esquemas de replicação de arquivos.
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
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.
Copiar
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
Copiar
@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},}
Copiar
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 -