Improving the Security of Split Data When Using Multidimensional Parity Algorithms

International Journal of Interactive Mobile Technologies

article

Gulzira Mukasheva¹  Karipzhanova Ardak Zhumagazievna¹  Aukenov Bolat Mayzhanuly¹  Urazbaeva Kumys Toleubekovna¹  Tlek Akhmetgalym¹ 

[1] Abay University

关键词: Security;    Distributed storage;    Data splitting;    Multidimensional parity;    Loss   recovery;    Parity files;   

DOI  :  10.3991/ijim.v16i21.36075

学科分类：社会科学、人文和艺术（综合）

来源: International Association of Online Engineering

【 摘 要 】

A model of distributed storage split data using algorithms, multidimensional parity, resistance to partial losses of the storage sites, is regarded as an alternative way of security that can replace the conventional multiple reservations and carrying costs of growth of the physical volume. In this model, the generated redundant data allows you to restore partial loss of the split parts. In this case, the recovery is performed at the expense of the parity files formed during the splitting procedure, in which the main action is the calculation of bitwise parity with summation modulo "two". With this additional operation between the source files, you can restore the corrupted file without distortion. A comparison with several models that use checksum codes for recovery shows that the estimated probability of losses due to storage failure in the case of multidimensional parity codes is significantly less than when using other split data storage options. Using the operation of adding the bits of undamaged files, you can completely restore corrupted files. According to the calculated data, even when theoretically non-recoverable losses are reached, it is always possible to find combinations of chain recovery. The complexity of alternative methods, including the iterative decoding method, makes a distributed split data storage system using multidimensional parity algorithms a more convenient error correction technology. Keywords— , , , , loss   recovery, .

【 授权许可】

CC BY