En-AR-PRNS: Entropy-Based Reliability for Configurable and Scalable Distributed Storage Systems

Andrei Tchernykh, Mikhail Babenko, Arutyun Avetisyan and Alexander Yu. Drozdov
Additional contact information
Andrei Tchernykh: Computer Science Department, Center for Scientific Research and Higher Education at Ensenada, Ensenada 22860, Mexico
Mikhail Babenko: Ivannikov Institute for System Programming, 109004 Moscow, Russia
Arutyun Avetisyan: Ivannikov Institute for System Programming, 109004 Moscow, Russia
Alexander Yu. Drozdov: Laboratory of Design and Modeling of Special-Purpose Computer Systems, Moscow Institute of Physics and Technology, 141701 Moscow, Russia

Mathematics, 2021, vol. 10, issue 1, 1-25

Abstract: Storage-as-a-service offers cost savings, convenience, mobility, scalability, redundant locations with a backup solution, on-demand with just-in-time capacity, syncing and updating, etc. While this type of cloud service has opened many opportunities, there are important considerations. When one uses a cloud provider, their data are no longer on their controllable local storage. Thus, there are the risks of compromised confidentiality and integrity, lack of availability, and technical failures that are difficult to predict in advance. The contribution of this paper can be summarized as follows: (1) We propose a novel mechanism, En-AR-PRNS, for improving reliability in the configurable, scalable, reliable, and secure distribution of data storage that can be incorporated along with storage-as-a-service applications. (2) We introduce a new error correction method based on the entropy (En) paradigm to correct hardware and software malfunctions, integrity violation, malicious intrusions, unexpected and unauthorized data modifications, etc., applying a polynomial residue number system (PRNS). (3) We use the concept of an approximation of the rank (AR) of a polynomial to reduce the computational complexity of the decoding. En-AR-PRNS combines a secret sharing scheme and error correction codes with an improved multiple failure detection/recovery mechanism. (4) We provide a theoretical analysis supporting the dynamic storage configuration to deal with varied user preferences and storage properties to ensure high-quality solutions in a non-stationary environment. (5) We discuss approaches to efficiently exploit parallel processing for security and reliability optimization. (6) We demonstrate that the reliability of En-AR-PRNS is up to 6.2 times higher than that of the classic PRNS.

Keywords: distributed data storage; security; reliability; error correction code; polynomial residue number system; entropy (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/1/84/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/1/84/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2021:i:1:p:84-:d:711917

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().