Comparative Performance Analysis of Information Dispersal Methods

Proceedings of the XXth Conference of Open Innovations Association FRUCT

Andrei Tchernykh¹  Maxim Deryabin²  Viktor Berezhnoy²  Anton Nazarov²  Nikolai Chervyakov²  Anvar Djurabaev²  Mikhail Babenko² 

[1] CICESE Research Center, Ensenada, Mexico;North Caucasus Federal University, Stavropol, Russian Federation;

关键词: Information Dispersal;    Distributed Systems;    Redundant Residue Number System;    Performance;    Erasure Codes;    Reliable Storage;   

DOI  :  

来源: DOAJ

【 摘 要 】

In this paper, we present an analysis of information dispersal methods for using in distributed storage systems, processing, and transmission of data. We provide a comparative study of the methods most widely used in practice considering performance, reliability and cryptographic security. There are three main approaches to the information dispersal: Information Dispersal Algorithm by Rabin, Residue Number System (RNS) and Polynomial Residue Number System. We propose an efficient data recovery algorithm based on data representation in the RNS. Comprehensive experimental analysis shows that the most productive approach for bit length up to 256 bits is the use of the RNS with our developed algorithm. We show that the use of the RNS for the design of distributed storage systems, data transmission, and data processing, can significantly reduce the time of information processing.

【 授权许可】

Unknown